답안 #891603

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891603 2023-12-23T10:13:30 Z hafo Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
17 ms 6448 KB
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pb push_back
#define pa pair<int, int>
#define pall pair<ll, int>
#define fi first
#define se second
#define TASK "test"
#define Size(x) (int) x.size()
#define all(x) x.begin(), x.end()
using namespace std;

template<typename T1, typename T2> bool mini (T1 &a, T2 b) {if(a > b) a = b; else return 0; return 1;}
template<typename T1, typename T2> bool maxi (T1 &a, T2 b) {if(a < b) a = b; else return 0; return 1;}

const int MOD = 1e9 + 7;
const int LOG = 20;
const int maxn = 2e5 + 7;
const ll oo = 1e18 + 69;

int n, a[maxn];
ll pre[maxn], suf[maxn];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    //freopen(TASK".inp", "r", stdin);
    //freopen(TASK".out", "w", stdout);

    cin>>n;
    for(int i = 1; i <= n; i++) {
        cin>>a[i];
        if(i > 1) pre[i] = pre[i - 1] + max(0, a[i - 1] + 1 - a[i]);
    }
    ll ans = oo;
    for(int i = n; i >= 1; i--) {
        if(i < n) suf[i] = suf[i + 1] + max(0, a[i + 1] + 1 - a[i]);
        mini(ans, max(pre[i], suf[i]));
    }
    cout<<ans;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 484 KB Output is correct
6 Correct 1 ms 480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 484 KB Output is correct
6 Correct 1 ms 480 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 472 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 17 ms 6028 KB Output is correct
27 Correct 17 ms 6236 KB Output is correct
28 Correct 17 ms 6228 KB Output is correct
29 Correct 17 ms 6236 KB Output is correct
30 Correct 14 ms 5480 KB Output is correct
31 Correct 17 ms 6236 KB Output is correct
32 Correct 16 ms 6228 KB Output is correct
33 Correct 17 ms 6228 KB Output is correct
34 Correct 17 ms 6236 KB Output is correct
35 Correct 13 ms 5396 KB Output is correct
36 Correct 14 ms 5464 KB Output is correct
37 Correct 13 ms 5468 KB Output is correct
38 Correct 17 ms 6256 KB Output is correct
39 Correct 17 ms 6448 KB Output is correct
40 Correct 17 ms 6228 KB Output is correct
41 Correct 17 ms 6128 KB Output is correct
42 Correct 16 ms 5980 KB Output is correct
43 Correct 16 ms 6228 KB Output is correct
44 Correct 16 ms 6132 KB Output is correct
45 Correct 17 ms 6236 KB Output is correct
46 Correct 17 ms 6324 KB Output is correct
47 Correct 17 ms 6264 KB Output is correct
48 Correct 17 ms 6232 KB Output is correct