Submission #984455

#TimeUsernameProblemLanguageResultExecution timeMemory
984455elitewantsyouGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++14
0 / 100
0 ms344 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; vector<int> v(n); for (int i = 0; i < n; i++) { cin >> v[i]; } int res = 0; for (int i = 0; i < n; i++) { auto a = v; for (int j = 0; j < i; j++) { a[j + 1] = max(a[j + 1], a[j] + 1); } for (int j = n - 1; j > i; j--) { a[j - 1] = max(a[j - 1], a[j] + 1); } for (int j = 0; j < n; j++) { res = max(res, a[j] - v[j]); } } cout << res << "\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...