Submission #698280

#	Time	Username	Problem	Language	Result	Execution time	Memory
698280		Magikarp4000	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	32 ms	8528 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n' 
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
#define int long long

const int MAXN = 2e5+1;
int n;
int a[MAXN], d[MAXN], l[MAXN], r[MAXN];

signed main() {
    OPTM;
    cin >> n;
    FOR(i,0,n) cin >> a[i];
    FOR(i,1,n) d[i] = a[i]-a[i-1];
    FOR(i,1,n) l[i] = l[i-1]+max(0ll,1-d[i]);
    FORR(i,n-1,0) r[i] = r[i+1]+max(0ll,1+d[i]);
    int res = LLINF;
    FOR(i,0,n) res = min(res, max(l[i],r[i+1]));
    cout << res;
}

• Subtask 1: 40 / 40
• Subtask 2: 60 / 60