fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. bool consistency(int n){
  33.  
  34. int target = n-1;
  35. for(int i=n-2; i>=0; i--){
  36. if(i+a[i] >= target){
  37. target = i;
  38. }
  39. }
  40. return target == 0;
  41. }
  42.  
  43.  
  44.  
  45.  
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57. int practice(int n){
  58.  
  59.  
  60. return 0;
  61. }
  62.  
  63.  
  64.  
  65.  
  66.  
  67. void solve() {
  68.  
  69. int n;
  70. cin>> n;
  71.  
  72. a.resize(n);
  73. for(int i=0; i<n; i++) cin >> a[i];
  74.  
  75. cout << boolalpha << consistency(n) << endl;
  76.  
  77.  
  78. }
  79.  
  80.  
  81.  
  82.  
  83.  
  84. int32_t main() {
  85. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  86.  
  87. int t = 1;
  88. // cin >> t;
  89. while (t--) {
  90. solve();
  91. }
  92.  
  93. return 0;
  94. }
Success #stdin #stdout 0s 5320KB
stdin
7
1 1 2 2 0 1 1
stdout
true