Submission #1093056

---

Source Code Expand

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


using namespace std;

bool canberemoved(vector<int>& A, int N) {
  while (true){
     auto it = max_element(A.begin(), A.end());
     if (*it  == 0) {
       return true;
     }

     int pos = it - A.begin();
     for (int i = 0;i < N; i++) {
       int ii = (pos+i+1)%N;
       A[ii] -= (i+1);
       if (A[ii]< 0) {
         return false;
       }
     }
  }
  return false;
}

int main() {
  int N;
  int x;
  vector<int> A;
  cin >> N;
  for (int i=0; i< N; i++) {
    cin >> x;
    A.push_back(x);
  }

  if (canberemoved(A, N)) {
    cout << "YES" <<endl;
  }
  else {
    cout << "NO" << endl;
  }

}

Submission Info

Judge Result