// Make the best become better
// No room for laziness
#include<bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 5e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n;
int a[maxN];
int f[21][maxN];
int lg[maxN];
int ans[maxN];
int mark[maxN];
void SparseTable()
{
for(int i=1; i<=n; i++)
f[0][i] = a[i];
for(int k=1; k<=lg[n]; k++)
for(int i=1; i<=n; i++)
{
int j = i + (1 << (k - 1));
if(j > n) f[k][i] = f[k - 1][i];
else f[k][i] = max(f[k - 1][i], f[k - 1][j]);
}
}
inline int get(int l, int r)
{
int k = lg[r - l + 1];
return max(f[k][l], f[k][r - (1 << k) + 1]);
}
void ReadInput()
{
cin >> n;
for(int i=1; i<=n; i++)
cin >> a[i];
for(int i=2; i<maxN; i++)
lg[i] = lg[i / 2] + 1;
}
void Solve()
{
mark[0] = 1;
SparseTable();
for(int i=1; i<=n; i++)
{
int res = 0;
int len = (int)sqrt(i - 2) + 1;
while(len >= mark[i - 1])
{
int r = i - (len - 1) * (len - 1) - 1;
int l = i - len * len;
l = max(1, l);
int val = get(l, r) + len - a[i];
if(res < val)
{
res = val;
mark[i] = len;
}
len--;
}
ans[i] = res;
}
mark[n + 1] = 1;
for(int i=n; i>=1; i--)
{
int res = 0;
int len = (int)sqrt(n - i - 1) + 1;
while(len >= mark[i + 1])
{
int l = i + (len - 1) * (len - 1) + 1;
int r = i + len * len;
r = min(r, n);
int val = get(l, r) + len - a[i];
if(res < val)
{
res = val;
mark[i] = len;
}
len--;
}
ans[i] = max(ans[i], res);
}
for(int i=1; i<=n; i++)
cout << ans[i] << '\n';
}
int32_t main()
{
// freopen("sol.inp", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2260 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
2260 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
2388 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
4820 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
21 ms |
6592 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
24 ms |
7500 KB |
Output is correct |
2 |
Correct |
16 ms |
7516 KB |
Output is correct |
3 |
Incorrect |
30 ms |
7680 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
23 ms |
10496 KB |
Output is correct |
2 |
Correct |
22 ms |
10416 KB |
Output is correct |
3 |
Incorrect |
23 ms |
11016 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
53 ms |
22236 KB |
Output is correct |
2 |
Correct |
49 ms |
21980 KB |
Output is correct |
3 |
Incorrect |
51 ms |
22780 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
419 ms |
36060 KB |
Output is correct |
2 |
Correct |
90 ms |
33996 KB |
Output is correct |
3 |
Incorrect |
79 ms |
36036 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
563 ms |
50220 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
126 ms |
47848 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |