UVa 10038 - Jolly Jumpers

题目：给出n个数，判断相邻的数字只差的绝对值序列是否是1 ~ n-1。

分析：简单题。直接计算判断即可。

#include <iostream>
#include <cstdlib>
#include <cstdio>  
#include <cmath>
  
using namespace std;

int have[3003];
int data[3003]; 

int main()  
{  
    int n;  
    while ( ~scanf("%d",&n) ) {
	    for ( int i = 0 ; i < n ; ++ i ) {  
	    	scanf("%d",&data[i]);
	    	have[i] = 0;
		}
		for ( int i = 1 ; i < n ; ++ i )
			have[abs(data[i]-data[i-1])] = 1;
	    int sum = 0;
	    for ( int i = 1 ; i < n ; ++ i )
	    	sum += have[i];
	    
	    if ( sum == n-1 ) printf("Jolly\n");
	    else printf("Not jolly\n");
    }  
    return 0;  
}