#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define Lg(x) 31 - __builtin_clz(x)
#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void setupIO(){
#define name "Whisper"
//Phu Trong from Nguyen Tat Thanh High School for gifted student
srand(time(NULL));
cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//freopen(name".inp", "r", stdin);
//freopen(name".out", "w", stdout);
cout << fixed << setprecision(10);
}
template <class X, class Y>
bool minimize(X &x, const Y &y){
X eps = 1e-9;
if (x > y + eps) {x = y; return 1;}
return 0;
}
template <class X, class Y>
bool maximize(X &x, const Y &y){
X eps = 1e-9;
if (x + eps < y) {x = y; return 1;}
return 0;
}
int nArr, a[MAX];
int prf[MAX], suf[MAX];
void Whisper(){
cin >> nArr;
for (int i = 1; i <= nArr; ++i) cin >> a[i];
for (int i = 1; i <= nArr; ++i){
prf[i] = prf[i - 1] + max(0ll, a[i - 1] - a[i] + 1);
}
for (int i = nArr; i >= 1; --i){
suf[i] = suf[i + 1] + max(0ll, a[i + 1] - a[i] + 1);
}
int ans = LINF;
for (int i = 1; i <= nArr; ++i){
minimize(ans, max(suf[i], prf[i]));
}
cout << ans;
}
signed main(){
setupIO();
int Test = 1;
// cin >> Test;
for ( int i = 1 ; i <= Test ; i++ ){
Whisper();
if (i < Test) cout << '\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2524 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2528 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2516 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 23 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 24 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2524 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2528 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2516 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 23 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 24 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 25 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 26 |
Correct |
17 ms |
6960 KB |
Output is correct |
| 27 |
Correct |
17 ms |
6996 KB |
Output is correct |
| 28 |
Correct |
18 ms |
7004 KB |
Output is correct |
| 29 |
Correct |
19 ms |
6996 KB |
Output is correct |
| 30 |
Correct |
15 ms |
6340 KB |
Output is correct |
| 31 |
Correct |
22 ms |
7004 KB |
Output is correct |
| 32 |
Correct |
19 ms |
7088 KB |
Output is correct |
| 33 |
Correct |
20 ms |
6884 KB |
Output is correct |
| 34 |
Correct |
17 ms |
7008 KB |
Output is correct |
| 35 |
Correct |
13 ms |
6092 KB |
Output is correct |
| 36 |
Correct |
15 ms |
6236 KB |
Output is correct |
| 37 |
Correct |
14 ms |
6228 KB |
Output is correct |
| 38 |
Correct |
19 ms |
7252 KB |
Output is correct |
| 39 |
Correct |
22 ms |
7108 KB |
Output is correct |
| 40 |
Correct |
17 ms |
7000 KB |
Output is correct |
| 41 |
Correct |
17 ms |
6996 KB |
Output is correct |
| 42 |
Correct |
16 ms |
6748 KB |
Output is correct |
| 43 |
Correct |
17 ms |
7000 KB |
Output is correct |
| 44 |
Correct |
16 ms |
7004 KB |
Output is correct |
| 45 |
Correct |
17 ms |
6848 KB |
Output is correct |
| 46 |
Correct |
17 ms |
6860 KB |
Output is correct |
| 47 |
Correct |
17 ms |
6996 KB |
Output is correct |
| 48 |
Correct |
17 ms |
7004 KB |
Output is correct |
