#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
// #pragma GCC optimize("Ofast,unroll-loops,fast-math")
// #pragma GCC target("popcnt,sse3,avx")
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll,ll> pll;
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define pb push_back
const int mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const int N = ll(1e6)+100;
const int M = ll(2e5) + 100;
const long long inf = 5e18;
//const long double eps = 1e-15L;
ll lcm(ll a, ll b) { return (a / __gcd(a,b))*b; }
ll binpow(ll a, ll b, ll m) { ll res=1; a %= m; while(b>0){ if(b&1)res=(res * a) % m; a=(a * a) % m; b/=2; } return res%m;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
#define int ll
int n, a[N], b[N], c[N], dp1[N], dp2[N];
void Baizho() {
cin>>n;
for(int i = 1; i <= n; i ++) cin>>a[i];
for(int i = 1; i <= n; i ++) {
b[i] = max(b[i - 1] + 1, a[i]);
dp1[i] = dp1[i - 1] + max(0ll, (b[i] - a[i]) - (b[i - 1] - a[i - 1]));
}
for(int i = n; i >= 1; i --) {
c[i] = max(c[i + 1] + 1, a[i]);
dp2[i] = dp2[i + 1] + max(0ll, (c[i] - a[i]) - (c[i + 1] - a[i + 1]));
}
int ans = min(dp1[n], dp2[1]);
for(int i = 1; i < n; i ++) {
// prefix i is sorted
if(b[i] != c[i + 1]) ans = min(ans, max(dp1[i], dp2[i + 1]));
}
cout<<ans<<"\n";
}
signed main() {
// Freopen("nondec");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
// precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) {Baizho(); }
}
Compilation message
Main.cpp: In function 'void Freopen(std::string)':
Main.cpp:35:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:35:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
35 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2420 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2404 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 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 |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2392 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 |
2392 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2420 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2404 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 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 |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2648 KB |
Output is correct |
| 16 |
Correct |
1 ms |
2392 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 |
2 ms |
2396 KB |
Output is correct |
| 26 |
Correct |
20 ms |
13964 KB |
Output is correct |
| 27 |
Correct |
20 ms |
13908 KB |
Output is correct |
| 28 |
Correct |
20 ms |
13916 KB |
Output is correct |
| 29 |
Correct |
19 ms |
13908 KB |
Output is correct |
| 30 |
Correct |
16 ms |
13396 KB |
Output is correct |
| 31 |
Correct |
20 ms |
13908 KB |
Output is correct |
| 32 |
Correct |
19 ms |
13892 KB |
Output is correct |
| 33 |
Correct |
21 ms |
13792 KB |
Output is correct |
| 34 |
Correct |
21 ms |
13972 KB |
Output is correct |
| 35 |
Correct |
16 ms |
13408 KB |
Output is correct |
| 36 |
Correct |
20 ms |
13468 KB |
Output is correct |
| 37 |
Correct |
17 ms |
13404 KB |
Output is correct |
| 38 |
Correct |
20 ms |
14000 KB |
Output is correct |
| 39 |
Correct |
19 ms |
13896 KB |
Output is correct |
| 40 |
Correct |
19 ms |
13908 KB |
Output is correct |
| 41 |
Correct |
19 ms |
13908 KB |
Output is correct |
| 42 |
Correct |
19 ms |
13744 KB |
Output is correct |
| 43 |
Correct |
20 ms |
13908 KB |
Output is correct |
| 44 |
Correct |
19 ms |
13932 KB |
Output is correct |
| 45 |
Correct |
20 ms |
13956 KB |
Output is correct |
| 46 |
Correct |
19 ms |
13916 KB |
Output is correct |
| 47 |
Correct |
21 ms |
13848 KB |
Output is correct |
| 48 |
Correct |
20 ms |
13916 KB |
Output is correct |
