제출 #535089

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

Main

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e6;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
 

signed main (){
    IOS();
    int n; cin>>n;
    vector<int> vc(n), pf(n), sf(n);
    REP(i,n){
        cin>>vc[i];
    }
    int cur=0;
    REP(i,n){
        if (i==0) {
            pf[i]=0;
            cur=vc[i];
        }
        else {
            pf[i]=pf[i-1]+max(0ll, vc[i-1]-vc[i]+1);
        }
    }
    RREP(i,n){
        if (i==n-1){
            sf[i]=0;
            cur=vc[i];
        }
        else {
            sf[i]=sf[i+1]+max(0ll, vc[i+1]-vc[i]+1);
        }
    }
    int ans=inf;
    REP(i,n){
        ans=min(ans, max(pf[i], sf[i]));
    }
    cout<<ans<<endl;
}

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

Main.cpp: In function 'int main()':
Main.cpp:63:9: warning: variable 'cur' set but not used [-Wunused-but-set-variable]
   63 |     int cur=0;
      |         ^~~

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