제출 #1118330

#제출 시각아이디문제언어결과실행 시간메모리
1118330gdragonGrowing Vegetables is Fun 4 (JOI21_ho_t1)C++17
100 / 100
29 ms6304 KiB
#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
int n;
int a[N];
long long pre[N], suf[N];
void read() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
}
void brute() {
    long long ans = INF;
    // for(int k = 1; k <= n; k++) {
    //     long long res = 0;
    //     for(int i = 2; i <= k; i++) {
    //         if (a[i] <= a[i - 1])
    //     }
    // }
}
void solve() {
    for(int i = 2; i <= n; i++) {
        pre[i] = pre[i - 1];
        if (a[i] <= a[i - 1]) pre[i] += a[i - 1] - a[i] + 1;
    }
    for(int i = n - 1; i >= 1; i--) {
        suf[i] = suf[i + 1];
        if (a[i] <= a[i + 1]) suf[i] += a[i + 1] - a[i] + 1;
    }
    long long ans = INF;
    for(int i = 1; i <= n; i++) {
        long long tmp = pre[i];
        if (suf[i] > tmp) tmp += abs(suf[i] - tmp);
        ans = min(ans, tmp); 
    }
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(TASK".inp", "r")) {
        freopen(TASK".inp", "r", stdin);
        freopen(TASK".out", "w", stdout);
    }
    int test = 1;
    // cin >> test;
    while(test--) {
        read();
        solve();
    }
    return 0;
}

// rmq - rmq2d
// hash
// fw - fw2d
// segtree

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

Main.cpp: In function 'void brute()':
Main.cpp:29:15: warning: unused variable 'ans' [-Wunused-variable]
   29 |     long long ans = INF;
      |               ^~~
Main.cpp: In function 'int main()':
Main.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen(TASK".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:58:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         freopen(TASK".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...