#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> Ii;
#define iii pair<ll,ii>
#define ull unsigned ll
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(void){
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n;
cin>>n;
ll arr[n];
ll b[n];
f(i,0,n){
cin>>arr[i];
}
ll ans = 1e18;
ll L[n] = {0},R[n] = {0};
f(i,0,n-1){
b[i] = arr[i+1] - arr[i];
ll posa = 0;
if(b[i] <= 0){
posa = -b[i] + 1;
}
L[i+1] = L[i] + posa;
}
for(ll i = n-2;i >= 0;i--){
ll posa = 0;
if(b[i] >= 0){
posa = b[i] + 1;
}
R[i] = R[i+1] + posa;
}
f(i,0,n){
ans = min(ans,max(L[i],R[i]));
}
cout<<ans<<"\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
328 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 ms |
212 KB |
Output is correct |
| 4 |
Correct |
0 ms |
212 KB |
Output is correct |
| 5 |
Correct |
1 ms |
340 KB |
Output is correct |
| 6 |
Correct |
1 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
1 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
1 ms |
340 KB |
Output is correct |
| 12 |
Correct |
1 ms |
340 KB |
Output is correct |
| 13 |
Correct |
1 ms |
340 KB |
Output is correct |
| 14 |
Correct |
1 ms |
340 KB |
Output is correct |
| 15 |
Correct |
1 ms |
340 KB |
Output is correct |
| 16 |
Correct |
1 ms |
340 KB |
Output is correct |
| 17 |
Correct |
1 ms |
336 KB |
Output is correct |
| 18 |
Correct |
1 ms |
328 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
1 ms |
336 KB |
Output is correct |
| 21 |
Correct |
1 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
1 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
332 KB |
Output is correct |
| 25 |
Correct |
1 ms |
332 KB |
Output is correct |
| 26 |
Correct |
30 ms |
8556 KB |
Output is correct |
| 27 |
Correct |
23 ms |
8396 KB |
Output is correct |
| 28 |
Correct |
23 ms |
8396 KB |
Output is correct |
| 29 |
Correct |
23 ms |
8420 KB |
Output is correct |
| 30 |
Correct |
24 ms |
7776 KB |
Output is correct |
| 31 |
Correct |
28 ms |
8420 KB |
Output is correct |
| 32 |
Correct |
25 ms |
8524 KB |
Output is correct |
| 33 |
Correct |
26 ms |
8408 KB |
Output is correct |
| 34 |
Correct |
25 ms |
8416 KB |
Output is correct |
| 35 |
Correct |
19 ms |
7648 KB |
Output is correct |
| 36 |
Correct |
19 ms |
7764 KB |
Output is correct |
| 37 |
Correct |
26 ms |
7768 KB |
Output is correct |
| 38 |
Correct |
23 ms |
8372 KB |
Output is correct |
| 39 |
Correct |
27 ms |
8420 KB |
Output is correct |
| 40 |
Correct |
23 ms |
8396 KB |
Output is correct |
| 41 |
Correct |
24 ms |
8396 KB |
Output is correct |
| 42 |
Correct |
22 ms |
8268 KB |
Output is correct |
| 43 |
Correct |
28 ms |
8456 KB |
Output is correct |
| 44 |
Correct |
24 ms |
8408 KB |
Output is correct |
| 45 |
Correct |
30 ms |
8412 KB |
Output is correct |
| 46 |
Correct |
24 ms |
8396 KB |
Output is correct |
| 47 |
Correct |
31 ms |
8524 KB |
Output is correct |
| 48 |
Correct |
29 ms |
8460 KB |
Output is correct |
