// Make the best become better
// No room for laziness
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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];
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()
{
SparseTable();
for(int i=1; i<=n; i++)
{
int res = 0;
int len = (int)sqrt(i - 2) + 1;
while(len >= 1)
{
int r = i - (len - 1) * (len - 1) - 1;
int l = i - len * len;
l = max(1, l);
if(a[i] + res - len >= get(l, i - 1)) break;
res = max(res, get(l, r) + len - a[i]);
len--;
}
len = (int)sqrt(n - i - 1) + 1;
while(len >= 1)
{
int l = i + (len - 1) * (len - 1) + 1;
int r = i + len * len;
r = min(r, n);
if(a[i] + res - len >= get(i + 1, r)) break;
res = max(res, get(l, r) + len - a[i]);
len--;
}
cout << res << '\n';
}
}
int32_t main()
{
//freopen("sol.inp", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2260 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2260 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2388 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
4564 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
23 ms |
6184 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
19 ms |
7020 KB |
Output is correct |
2 |
Correct |
13 ms |
6996 KB |
Output is correct |
3 |
Correct |
137 ms |
7132 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
26 ms |
9716 KB |
Output is correct |
2 |
Correct |
27 ms |
9684 KB |
Output is correct |
3 |
Correct |
156 ms |
10188 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
61 ms |
20448 KB |
Output is correct |
2 |
Correct |
58 ms |
20272 KB |
Output is correct |
3 |
Correct |
476 ms |
20972 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
718 ms |
33372 KB |
Output is correct |
2 |
Correct |
92 ms |
31716 KB |
Output is correct |
3 |
Correct |
991 ms |
33952 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
959 ms |
46384 KB |
Output is correct |
2 |
Correct |
124 ms |
43340 KB |
Output is correct |
3 |
Execution timed out |
1096 ms |
43828 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
129 ms |
43868 KB |
Output is correct |
2 |
Correct |
123 ms |
43340 KB |
Output is correct |
3 |
Execution timed out |
1054 ms |
43752 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |