답안 #527698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
527698 2022-02-18T03:52:16 Z knightron0 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
26 ms 6892 KB
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n;
    cin>>n;
    int a[n+4];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int pref[n+4], suff[n+4];
    pref[0] = suff[n-1] = 0;
    for(int i=1;i<n;i++){
        pref[i] = pref[i-1];
        pref[i] += max((int)0, a[i-1]-a[i]+1);
    }
    for(int i=n-2;i>=0;i--){
        suff[i] = suff[i+1];
        suff[i] += max((int)0, a[i+1]-a[i]+1);
    }
    int ans = LLONG_MAX;
    for(int i=0;i<n;i++){
        ans = min(ans, max(pref[i], suff[i]));
    }
    cout<<ans<<endl;
    return 0;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 312 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 208 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 324 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 324 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 1 ms 336 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 22 ms 6848 KB Output is correct
27 Correct 23 ms 6848 KB Output is correct
28 Correct 23 ms 6860 KB Output is correct
29 Correct 26 ms 6856 KB Output is correct
30 Correct 20 ms 6208 KB Output is correct
31 Correct 22 ms 6848 KB Output is correct
32 Correct 22 ms 6832 KB Output is correct
33 Correct 21 ms 6836 KB Output is correct
34 Correct 23 ms 6892 KB Output is correct
35 Correct 19 ms 6076 KB Output is correct
36 Correct 18 ms 6192 KB Output is correct
37 Correct 18 ms 6212 KB Output is correct
38 Correct 23 ms 6836 KB Output is correct
39 Correct 22 ms 6840 KB Output is correct
40 Correct 23 ms 6864 KB Output is correct
41 Correct 23 ms 6852 KB Output is correct
42 Correct 22 ms 6708 KB Output is correct
43 Correct 21 ms 6852 KB Output is correct
44 Correct 21 ms 6844 KB Output is correct
45 Correct 23 ms 6848 KB Output is correct
46 Correct 21 ms 6856 KB Output is correct
47 Correct 23 ms 6844 KB Output is correct
48 Correct 21 ms 6836 KB Output is correct