제출 #914406

#제출 시각아이디문제언어결과실행 시간메모리
914406ReLiceGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++14
100 / 100
20 ms8680 KiB
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool f=0;
    if (x>y){x=y;f=1;}
    return f;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool f=0;
    if (x<y){x=y;f=1;}
    return f;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
void solve(){
    ll i,j;
    ll n;
    cin>>n;
    vll v(n),old;
    for(i=0;i<n;i++) cin>>v[i];
    ll pref[n],suf[n];
    old=v;
    pref[0]=suf[n-1]=0;
    for(i=1;i<n;i++){
        pref[i]=pref[i-1]+max(0ll,v[i-1]-v[i]+1);
    }
    v=old;
    for(i=n-2;i>=0;i--){
        suf[i]=suf[i+1]+max(0ll,v[i+1]-v[i]+1);
    }
    ll mn=inf;
    for(i=0;i<n;i++){
        mn=min(mn,max(pref[i],suf[i]));
    }
    cout<<mn<<endl;

}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*



*/

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'void solve()':
Main.cpp:46:10: warning: unused variable 'j' [-Wunused-variable]
   46 |     ll i,j;
      |          ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...