Submission #1093040

---

Source Code Expand

#include <iostream>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int n;
	cin >> n;
	int a[n];

	for(int i = 0; i < n; i++){
		cin >> a[i];
	}

	bool isAllZero = false;
	bool isIll = false;

	while(!isAllZero && !isIll){
		int max = -1;
		int maxpos = -1;
		for(int i = 0; i < n; i++){
			if(max < a[i]){
				max = a[i];
				maxpos = i;
			}
		}

		for(int i = 0; i < n; i++){
			a[(i + maxpos+1) % n] -= i+1;
		}
		// for(int i = 0; i < n; i++){
		// 	cout << a[i] << ",";
		// }
		// cout << endl;

		isAllZero = true;

		for(int i = 0; i < n; i++){
			if(a[i] != 0){
				isAllZero = false;
			}
			if(a[i] < 0){
				isIll = true;
			}
		}
	}


	if(isIll){
		cout << "NO" << endl;
	}else{
		cout << "YES" << endl;
	}

	return 0;
}

Submission Info

Judge Result