UVa 10038 - Jolly Jumpers

UVa 10038 - Jolly Jumpers

题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=12&page=show_problem&problem=979

#include <iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;
const int maxx=3010;
int a[maxx],b[maxx];
int main()
{
    int n,i;
    while(cin>>n)
    {
       memset(a,0,sizeof(a));
       memset(b,0,sizeof(b));
        if(n==0)
        break;
        else
        {
            for(i=0;i<n;i++)
            cin>>a[i];
            for(i=0;i<n-1;i++)
            b[i]=fabs(a[i+1]-a[i]);
            sort(b,b+n-1);
             for(i=0;i<n-1;i++)
             if(b[i]!=i+1)
             break;
             if(i==n-1)
             cout<<"Jolly"<<endl;
             else
             cout<<"Not jolly"<<endl;
        }
    }
}