研0 冲刺算法竞赛 day10 P1152 欢乐的跳

P1152 欢乐的跳 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

思路：读取数据，依次相减，排序对比即可

代码：

#include<iostream>
#include<algorithm>
using namespace std;

int a[1001],b[1001];


int main()
{
	int n;
	int num;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> num;
		a[i] = num;
	}
	//for (int i = 0; i < n; i++) {
	//	cout << a[i] << " ";
	//}
	//cout << endl;

	int j = 0;


	for (int i = 0; i < n-1; i++)
	{
		num = a[i] - a[i + 1];
		if (num > 0)
			b[j++] = num;
		else
			b[j++] = -1 * num;
	}

	sort(b, b + n - 1);
	int flag = 1;

	//for (int i = 0; i < n - 1; i++) {
	//	cout << b[i] << " ";
	//}
	j = 1;
	for (int i = 0; i < n - 1; i++) {
		if (b[i] != j++)
			flag = 0;
	}
	if (flag == 1)
		cout << "Jolly";
	else
		cout << "Not jolly";
	return 0;
}

总结：

读题要仔细，一开始看成连续输入了，没有n

记单词algorithm