제출 #1006943

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1006943		faqinyeager	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	0 / 100	1 ms	408 KiB

Main

#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
using ll = long long;
 
int n;
vector<ll> a, pref, suff;
 
int main(){
    cin >> n;
    
    a.resize(n);
    pref.resize(n, 0);
    suff.resize(n, 0);
    
    for(int i = 0; i < n; i++) cin >> a[i];
    
    for(int i = 1; i < n; i++) if(a[i - 1] >= a[i]) pref[i] = a[i - 1] - a[i] + 1;
    for(int i = n - 2; i >= 0; i--) if(a[i] <= a[i + 1]) suff[i] = a[i + 1] - a[i] + 1;
    
    //for(int i = 0; i < n; i++) cout << pref[i] << ' '; cout << '\n';
    //for(int i = 0; i < n; i++) cout << suff[i] << ' '; cout << "\n\n";
    
    int l = 0, r = n - 1;
    ll lsum = 0, rsum = 0;
    
    while(l <= r){
        if(lsum < rsum){
            lsum += pref[l];
            l++;
        }else{
            rsum += suff[r];
            r--;
        }
    }
    
    cout << max(lsum, rsum);
    
}    

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