제출 #442652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
442652		zaneyu	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	35 ms	6332 KiB

Main

/*input
8
12 2 34 85 4 91 29 85
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+9;
const ld PI=acos(-1);
const ld eps=1e-3;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=2e5+5;
const int maxlg=__lg(maxn)+2;
ll pref[maxn],suff[maxn];
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n;
    int pv;
    cin>>pv;
    vector<int> v;
    REP(i,n-1){
        int x;
        cin>>x;
        v.pb(x-pv);
        pv=x;
    } 
    REP1(i,n-1) pref[i]=pref[i-1]+max(-v[i-1]+1,0);
    for(int i=n-1;i>=1;i--) suff[i]=suff[i+1]+max(v[i-1]+1,0);
    ll ans=INF64;
    REP(i,n){
        MNTO(ans,max(pref[i],suff[i+1]));
    }
    cout<<ans<<'\n';
}  

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