POJ2575 Jolly Jumpers

关注

原创最新推荐文章于 2026-08-03 10:10:07 发布 425 阅读 AI 写同款· GEO 优化 ›

POJ 2575 Jolly Jumpers（我的水题之路——数组绝对差值为1到n-1） Jolly Jumpers Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13365 Accepted: 4128 Description A sequence of n > 0 integers is called a jolly jumper if t 阅读详情

#include <iostream>
#include <set>
#include <stdio.h>
using namespace std;

int mm[3000];
int main(){
    int n;
    while(cin >> n){
        memset(mm,0,sizeof(mm));
        int last,current;
        cin >> last;
        for(int i=1 ; i < n; ++i){
            cin    >> current;
            int tmp = abs(current - last);
            mm[tmp] = 1;
            last = current;
        }
        int i = 1;
        for(; i <n ; ++i){
            if(mm[i] == 0)    {
                break;
            }
        }
        if(i == n)
            cout << "Jolly" << endl;
        else
            cout << "Not jolly" << endl;
    }
    return 1;
}