题干：
题目大意：
要任意相邻的两个数的绝对值在[1,n)，而且这个范围内的每个数都要出现一次。
解题报告：
直接模拟就行了、
AC代码：
#include<cstdio>#include<iostream>#include<algorithm>#include<queue>#include<map>#include<vector>#include<set>#include<string>#include<cmath>#include<cstring>#define ll long long#define pb push_back#define pm make_pair#define fi first#define se secondusing namespace std;const int MAX = 2e5 + 5;int n;bool bk[MAX];int a[MAX];int main(){while(~scanf("%d",&n)) {int flag = 1;memset(bk,0,sizeof bk);for(int i = 1; i<=n; i++) scanf("%d",a+i);for(int i = 1; i< n; i++) {bk[(int)abs(a[i]-a[i+1])]=1;//printf("%d\n",(int)abs(a[i]-a[i+1]));}for(int i = 1; i<=n-1; i++) {if(bk[i]==0) {flag = 0; }}if(flag) puts("Jolly");else puts("Not jolly"); }return 0 ;}
