답안 #926666

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
926666	2024-02-13T13:42:40 Z	VMaksimoski008	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	65 ms	4440 KB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n, i;
    cin >> n;
    
    vector<int> v(n);
    vector<ll> pref(n), suf(n);
    for(i=0; i<n; i++) cin >> v[i];
    for(i=1; i<n; i++) pref[i] = max(0, v[i-1]-v[i]+1) + pref[i-1];
    for(i=n-2; i>=0; i--) suf[i] = max(0, v[i+1]-v[i]+1) + suf[i+1];

    ll ans = 1e18;
    for(i=0; i<n; i++) ans = min(ans, max(pref[i], suf[i]));
    cout << ans << '\n';
}

Subtask #1

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 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	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct

Subtask #2

60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	348 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	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	65 ms	4340 KB	Output is correct
27	Correct	59 ms	4184 KB	Output is correct
28	Correct	57 ms	4188 KB	Output is correct
29	Correct	58 ms	4340 KB	Output is correct
30	Correct	43 ms	4188 KB	Output is correct
31	Correct	57 ms	4188 KB	Output is correct
32	Correct	56 ms	4336 KB	Output is correct
33	Correct	60 ms	4344 KB	Output is correct
34	Correct	59 ms	4436 KB	Output is correct
35	Correct	40 ms	4188 KB	Output is correct
36	Correct	46 ms	4188 KB	Output is correct
37	Correct	43 ms	4188 KB	Output is correct
38	Correct	56 ms	4440 KB	Output is correct
39	Correct	57 ms	4340 KB	Output is correct
40	Correct	57 ms	4340 KB	Output is correct
41	Correct	56 ms	4188 KB	Output is correct
42	Correct	63 ms	4440 KB	Output is correct
43	Correct	57 ms	4188 KB	Output is correct
44	Correct	57 ms	4188 KB	Output is correct
45	Correct	56 ms	4184 KB	Output is correct
46	Correct	56 ms	4188 KB	Output is correct
47	Correct	57 ms	4188 KB	Output is correct
48	Correct	57 ms	4188 KB	Output is correct