UVA 10038 - Jolly Jumpers

#include<stdio.h>
#include<algorithm>
using namespace std;
main()
{
long int i,n;
while(scanf("%ld",&n)!=EOF)
{
long ar[10000]={0},j,flag=0;
for(i=0;i<n;i++)
{
scanf("%ld",&ar[i]);
}
long k=0,diff,ar1[10000]={0},k1;
for(j=0;j<n-1;j++)
{
diff=ar[j]-ar[j+1];
if(diff<0)
{
diff=diff*-1;
ar1[k]=diff;
}
else
ar1[k]=diff;
k++;
}
sort(ar1,ar1+k);
for(j=k-1;j>=0;j--)
{
if(ar1[j]-ar1[j-1]!=1)
{
flag=1;
}
}
if(flag==1)
{
printf("Not jolly\n");
}
else
printf("Jolly\n");
}
}