#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define vs vector<string>
#define vc vector<char>
#define vb vector<bool>
#define vp vector<pair<ll, ll>>
#define pp pair<ll, ll>
#define qi queue<ll>
#define qp queue<pp>
#define pqi priority_queue<ll>
#define pqp priority_queue<pp>
#define mi map<ll, ll>
#define mpi map<pp, ll>
#define mip map<ll, pp>
#define mpp map<pp, pp>
#define mb map<ll, bool>
#define si set<ll>
#define sp set<pp>
#define mod 1000000007
#define rep(a, b) for(int a = 0; a < (b); a++)
#define rep2(a, b) for(int a = 1; a < (b); a++)
#define inf 1000000000000000000
int main() {
int n;
cin >> n;
vi A(n);
rep(i, n) {
cin >> A[i];
}
int l = 0; int r = n - 1;
ll ans = 0;
while (l < r) {
while (l + 1 < n && A[l] < A[l + 1]) {
l++;
}
while (r-1 >= 0 && A[r] < A[r - 1]) {
r--;
}
if (l + 1 == r && A[l] == A[r]) {
ans++;
break;
}
if (!(l < r)) {
break;
}
int xl = A[l] - A[l + 1] + 1;
int xr = A[r] - A[r - 1] + 1;
int xmin = min(xl, xr);
A[l] -= xmin;
A[r] -= xmin;
ans += xmin;
}
cout << ans << endl;
}
# |
Verdict |
Execution time |
Memory |
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 |
444 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 |
600 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 |
344 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
348 KB |
Output is correct |
22 |
Correct |
1 ms |
600 KB |
Output is correct |
23 |
Correct |
1 ms |
348 KB |
Output is correct |
24 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
444 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 |
600 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 |
344 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
348 KB |
Output is correct |
22 |
Correct |
1 ms |
600 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 |
57 ms |
3024 KB |
Output is correct |
27 |
Correct |
57 ms |
3156 KB |
Output is correct |
28 |
Correct |
57 ms |
3152 KB |
Output is correct |
29 |
Correct |
56 ms |
3264 KB |
Output is correct |
30 |
Correct |
42 ms |
2744 KB |
Output is correct |
31 |
Correct |
56 ms |
3152 KB |
Output is correct |
32 |
Correct |
60 ms |
3156 KB |
Output is correct |
33 |
Correct |
56 ms |
3120 KB |
Output is correct |
34 |
Correct |
56 ms |
3136 KB |
Output is correct |
35 |
Correct |
38 ms |
2756 KB |
Output is correct |
36 |
Correct |
42 ms |
2644 KB |
Output is correct |
37 |
Correct |
43 ms |
2580 KB |
Output is correct |
38 |
Correct |
57 ms |
3168 KB |
Output is correct |
39 |
Correct |
57 ms |
3152 KB |
Output is correct |
40 |
Correct |
57 ms |
3156 KB |
Output is correct |
41 |
Correct |
57 ms |
3156 KB |
Output is correct |
42 |
Correct |
55 ms |
2896 KB |
Output is correct |
43 |
Correct |
65 ms |
3288 KB |
Output is correct |
44 |
Correct |
57 ms |
3108 KB |
Output is correct |
45 |
Correct |
56 ms |
3156 KB |
Output is correct |
46 |
Correct |
58 ms |
3156 KB |
Output is correct |
47 |
Correct |
60 ms |
3240 KB |
Output is correct |
48 |
Correct |
58 ms |
3148 KB |
Output is correct |