/*
Code written by Talant I.D.
*/
#include <bits/stdc++.h>
//~ #include <ext/pb_ds/assoc_container.hpp>
//~ using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
//~ typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
//~ #define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
const ll mod = 1e9+7;
ll mode(ll a) {
while (a < 0) {
a += mod;
}
return a % mod;
}
ll subt(ll a, ll b) {
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b) {
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b) {
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int main() {
do_not_disturb
int n;
cin >> n;
vector <ll> a(n), b(n-1), L(n-1), R(n-1);
for (auto &to : a) cin >> to;
for (int i = 0; i < n-1; i++) {
b[i] = a[i+1]-a[i];
}
L[0] = max(1-b[0], 0ll);
R[n-2] = max(1+b[n-2], 0ll);
for (int i = 1; i < n-1; i++) {
L[i] = L[i-1]+max(1-b[i], 0ll);
}
for (int i = n-3; i >= 0; i--) {
R[i] = R[i+1]+max(1+b[i], 0ll);
}
ll ans = min(L[n-2], R[0]);
for (int i = 0; i < n-2; i++) {
ans = min(ans, max(L[i], R[i+1]));
}
cout << ans;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
2 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
204 KB |
Output is correct |
2 |
Correct |
1 ms |
204 KB |
Output is correct |
3 |
Correct |
1 ms |
204 KB |
Output is correct |
4 |
Correct |
1 ms |
204 KB |
Output is correct |
5 |
Correct |
1 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
1 ms |
332 KB |
Output is correct |
8 |
Correct |
1 ms |
332 KB |
Output is correct |
9 |
Correct |
1 ms |
332 KB |
Output is correct |
10 |
Correct |
1 ms |
332 KB |
Output is correct |
11 |
Correct |
1 ms |
332 KB |
Output is correct |
12 |
Correct |
1 ms |
332 KB |
Output is correct |
13 |
Correct |
1 ms |
332 KB |
Output is correct |
14 |
Correct |
1 ms |
332 KB |
Output is correct |
15 |
Correct |
1 ms |
332 KB |
Output is correct |
16 |
Correct |
1 ms |
332 KB |
Output is correct |
17 |
Correct |
1 ms |
332 KB |
Output is correct |
18 |
Correct |
1 ms |
332 KB |
Output is correct |
19 |
Correct |
1 ms |
332 KB |
Output is correct |
20 |
Correct |
1 ms |
332 KB |
Output is correct |
21 |
Correct |
1 ms |
332 KB |
Output is correct |
22 |
Correct |
2 ms |
332 KB |
Output is correct |
23 |
Correct |
1 ms |
332 KB |
Output is correct |
24 |
Correct |
1 ms |
332 KB |
Output is correct |
25 |
Correct |
1 ms |
332 KB |
Output is correct |
26 |
Correct |
29 ms |
6476 KB |
Output is correct |
27 |
Correct |
31 ms |
6476 KB |
Output is correct |
28 |
Correct |
39 ms |
6588 KB |
Output is correct |
29 |
Correct |
33 ms |
6572 KB |
Output is correct |
30 |
Correct |
30 ms |
6476 KB |
Output is correct |
31 |
Correct |
29 ms |
6476 KB |
Output is correct |
32 |
Correct |
29 ms |
6488 KB |
Output is correct |
33 |
Correct |
33 ms |
6588 KB |
Output is correct |
34 |
Correct |
32 ms |
6568 KB |
Output is correct |
35 |
Correct |
24 ms |
6592 KB |
Output is correct |
36 |
Correct |
25 ms |
6592 KB |
Output is correct |
37 |
Correct |
25 ms |
6476 KB |
Output is correct |
38 |
Correct |
30 ms |
6476 KB |
Output is correct |
39 |
Correct |
32 ms |
6572 KB |
Output is correct |
40 |
Correct |
31 ms |
6476 KB |
Output is correct |
41 |
Correct |
32 ms |
6476 KB |
Output is correct |
42 |
Correct |
30 ms |
6476 KB |
Output is correct |
43 |
Correct |
32 ms |
6476 KB |
Output is correct |
44 |
Correct |
33 ms |
6476 KB |
Output is correct |
45 |
Correct |
31 ms |
6476 KB |
Output is correct |
46 |
Correct |
29 ms |
6476 KB |
Output is correct |
47 |
Correct |
30 ms |
6476 KB |
Output is correct |
48 |
Correct |
33 ms |
6596 KB |
Output is correct |