# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
396911 | AQT | Growing Vegetables is Fun 4 (JOI21_ho_t1) | C++14 | 30 ms | 6148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int N;
int arr[200005];
/*
int mnpre[200005];
long long sumpre[200005];
int mnsuf[200005];
long long sumsuf[200005];
*/
long long mxpre[200005];
long long mxsuf[200005];
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
for(int i = 1; i <= N; i++){
cin >> arr[i];
}
/*
for(int i = 1; i <= N; i++){
mnpre[i] = max(arr[i], mnpre[i-1] + 1);
sumpre[i] = sumpre[i-1] + mnpre[i] - arr[i];
}
for(int i = N; i; i--){
mnsuf[i] = max(arr[i], mnsuf[i+1] + 1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |