poj2575-Jolly Jumpers

Jolly Jumpers
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 17306 Accepted: 5205

Description
A sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance,

1 4 2 3

is a jolly jumper, because the absolutes differences are 3, 2, and 1 respectively. The definition implies that any sequence of a single integer is a jolly jumper. You are to write a program to determine whether or not each of a number of sequences is a jolly jumper.

Input
Each line of input contains an integer n < 3000 followed by n integers representing the sequence.

Output
For each line of input, generate a line of output saying "Jolly" or "Not jolly".

Sample Input

4 1 4 2 3
5 1 4 2 -1 6

Sample Output

Jolly
Not jolly

猛然想起还有短码之美没做完，于是在这寒假补上

记得当时是做不起，唉，还好现在一遍ac了，哈哈！

用一个数组标记1到n-1就行，空间复杂度o（n）

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#include<algorithm>
#include<cctype>
#include<cstdlib>
#include<vector>
using namespace std;
int main()
{
	int n;
	while(cin>>n)
	{
		int num[10000];
		for(int i=0;i<n;i++)
			cin>>num[i];
			
		bool bo[10000]={0};
		
		for(int i=0;i<n-1;i++)
			bo[abs(num[i]-num[i+1])]=1;
			
		
		int cnt=0;
		for(int i=1;i<=n-1;i++)
		{
			if(bo[i]==1)
				cnt++;
		}
		if(cnt<n-1) cout<<"Not jolly"<<endl;
		else cout<<"Jolly"<<endl; 
	}
	return 0;
} 

寒假加油，这只是开始！