제출 #426829

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
426829		talant117408	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	39 ms	6596 KiB

Main

/*
    Code written by Talant I.D.
*/

#include <bits/stdc++.h>
//~ #include <ext/pb_ds/assoc_container.hpp>
 
//~ using namespace __gnu_pbds;
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
//~ typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
//~ #define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const ll mod = 1e9+7;
 
ll mode(ll a) {
    while (a < 0) {
        a += mod;
    }
    return a % mod;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

int main() {
    do_not_disturb
    
    int n;
    cin >> n;
    vector <ll> a(n), b(n-1), L(n-1), R(n-1);
    for (auto &to : a) cin >> to;
    for (int i = 0; i < n-1; i++) {
        b[i] = a[i+1]-a[i];
    }
    L[0] = max(1-b[0], 0ll);
    R[n-2] = max(1+b[n-2], 0ll);
    for (int i = 1; i < n-1; i++) {
        L[i] = L[i-1]+max(1-b[i], 0ll);
    }
    for (int i = n-3; i >= 0; i--) {
        R[i] = R[i+1]+max(1+b[i], 0ll);
    }
    
    ll ans = min(L[n-2], R[0]);
    for (int i = 0; i < n-2; i++) {
        ans = min(ans, max(L[i], R[i+1]));
    }
    cout << ans;
    
    return 0;
}

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