#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005;
const ll INF = 1000000009000000009;
int n;
int a[N];
ll p[N], s[N];
void solv()
{
cin >> n;
for (int i = 1; i <= n; ++i)
cin >> a[i];
for (int i = 1; i <= n; ++i)
{
p[i] = p[i - 1];
if (a[i] <= a[i - 1])
p[i] += (a[i - 1] + 1 - a[i]);
}
for (int i = n; i >= 1; --i)
{
s[i] = s[i + 1];
if (a[i] <= a[i + 1])
s[i] += (a[i + 1] + 1 - a[i]);
}
ll ans = INF;
for (int i = 1; i <= n; ++i)
{
ll x = a[i - 1], y = a[i], z = a[i + 1];
if (p[i - 1] > s[i + 1])
{
x += p[i - 1] - s[i + 1];
y += p[i - 1] - s[i + 1];
}
else
{
y += s[i + 1] - p[i - 1];
z += s[i + 1] - p[i - 1];
}
ll yans = max(p[i - 1], s[i + 1]);
if (y <= max(x, z))
yans += max(x, z) + 1 - y;
ans = min(ans, yans);
}
cout << ans << "\n";
}
int main()
{
#ifdef SOMETHING
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif // SOMETHING
ios_base::sync_with_stdio(false), cin.tie(0);
int tt = 1;
//cin >> tt;
while (tt--)
{
solv();
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 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 |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
0 ms |
340 KB |
Output is correct |
| 13 |
Correct |
0 ms |
340 KB |
Output is correct |
| 14 |
Correct |
0 ms |
340 KB |
Output is correct |
| 15 |
Correct |
0 ms |
340 KB |
Output is correct |
| 16 |
Correct |
0 ms |
340 KB |
Output is correct |
| 17 |
Correct |
0 ms |
340 KB |
Output is correct |
| 18 |
Correct |
0 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| 21 |
Correct |
0 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
0 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
1 ms |
340 KB |
Output is correct |
| 4 |
Correct |
0 ms |
340 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 |
0 ms |
340 KB |
Output is correct |
| 10 |
Correct |
1 ms |
340 KB |
Output is correct |
| 11 |
Correct |
0 ms |
340 KB |
Output is correct |
| 12 |
Correct |
0 ms |
340 KB |
Output is correct |
| 13 |
Correct |
0 ms |
340 KB |
Output is correct |
| 14 |
Correct |
0 ms |
340 KB |
Output is correct |
| 15 |
Correct |
0 ms |
340 KB |
Output is correct |
| 16 |
Correct |
0 ms |
340 KB |
Output is correct |
| 17 |
Correct |
0 ms |
340 KB |
Output is correct |
| 18 |
Correct |
0 ms |
340 KB |
Output is correct |
| 19 |
Correct |
1 ms |
340 KB |
Output is correct |
| 20 |
Correct |
0 ms |
340 KB |
Output is correct |
| 21 |
Correct |
0 ms |
340 KB |
Output is correct |
| 22 |
Correct |
1 ms |
340 KB |
Output is correct |
| 23 |
Correct |
0 ms |
340 KB |
Output is correct |
| 24 |
Correct |
1 ms |
340 KB |
Output is correct |
| 25 |
Correct |
1 ms |
340 KB |
Output is correct |
| 26 |
Correct |
21 ms |
4228 KB |
Output is correct |
| 27 |
Correct |
22 ms |
4192 KB |
Output is correct |
| 28 |
Correct |
20 ms |
4184 KB |
Output is correct |
| 29 |
Correct |
22 ms |
4144 KB |
Output is correct |
| 30 |
Correct |
19 ms |
4176 KB |
Output is correct |
| 31 |
Correct |
21 ms |
4200 KB |
Output is correct |
| 32 |
Correct |
21 ms |
4128 KB |
Output is correct |
| 33 |
Correct |
27 ms |
4172 KB |
Output is correct |
| 34 |
Correct |
19 ms |
4212 KB |
Output is correct |
| 35 |
Correct |
19 ms |
4152 KB |
Output is correct |
| 36 |
Correct |
17 ms |
4312 KB |
Output is correct |
| 37 |
Correct |
16 ms |
4144 KB |
Output is correct |
| 38 |
Correct |
20 ms |
4236 KB |
Output is correct |
| 39 |
Correct |
20 ms |
4168 KB |
Output is correct |
| 40 |
Correct |
20 ms |
4180 KB |
Output is correct |
| 41 |
Correct |
21 ms |
4132 KB |
Output is correct |
| 42 |
Correct |
20 ms |
4180 KB |
Output is correct |
| 43 |
Correct |
21 ms |
4184 KB |
Output is correct |
| 44 |
Correct |
20 ms |
4208 KB |
Output is correct |
| 45 |
Correct |
20 ms |
4108 KB |
Output is correct |
| 46 |
Correct |
20 ms |
4292 KB |
Output is correct |
| 47 |
Correct |
20 ms |
4204 KB |
Output is correct |
| 48 |
Correct |
20 ms |
4140 KB |
Output is correct |
