Submission #1154630

#TimeUsernameProblemLanguageResultExecution timeMemory
1154630NurislamGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++20
0 / 100
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; //#define int long long //#define all(x) x.begin(),x.end() //#define rall(x) x.rbegin(),x.rend() //#define ff first //#define ss second //#define pb push_back //template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return true; } return false; } //template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return true; } return false; } //mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //#define rnd(l, r) uniform_int_distribution <int> (l, r)(rng) const int inf = 1e6, mod = 1e9 + 7; void solve(){ int n; cin >> n; vector<int> a(n); for(int &i : a)cin >> i; int r = n-2, ad = 0, i = 1; while(r > 0){ if(a[r] > a[r+1])r --; else break; } for(; i < n; i++ ){ a[i] += ad; if(a[i] > a[i-1])continue; while(r > i){ a[r] += ad; if(a[r] > a[r+1])r --; else break; } if(i > r)break; // > i ... r < int df = a[i-1] - a[i] + 1; ad += df; a[i] += df; } if(r == i - 1 && a[i] == a[r])ad++; cout << ad << '\n'; } signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); int tt = 1; //cin >> tt; while(tt--){ solve(); }; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...