#include <bits/stdc++.h>
using namespace std;
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>
struct point {
int i, l, r;
};
const int N = 5e5 + 15;
int n, a[N], dp[N];
deque <point> q;
inline double get(int j, int i) {
return a[i] + sqrt(abs(i - j));
}
void process() {
q.clear();
for(int i = 1; i <= n; ++i) {
++q.front().l;
while(!q.empty() && q.front().r < q.front().l)
q.pop_front();
while(!q.empty() && get(q.back().l, q.back().i) < get(q.back().l, i))
q.pop_front();
if(q.empty())
q.push_back({i, i, n});
else if(get(n, i) > get(n, q.back().i)) {
int l = q.back().l, r = q.back().r, res = 0;
while(l <= r) {
int mid = l + r >> 1;
if(get(mid, i) > get(mid, q.back().i))
res = mid, l = mid + 1;
else
r = mid - 1;
}
q.back().r = res - 1;
q.push_back({i, res, n});
}
dp[i] = max(dp[i], (int)ceil(get(i, q.front().i)) - a[i]);
}
}
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
process();
reverse(a + 1, a + 1 + n);
reverse(dp + 1, dp + 1 + n);
process();
for(int i = n; i; --i)
printf("%d\n", dp[i]);
return 0;
}
Compilation message
pio.cpp: In function 'void process()':
pio.cpp:46:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int mid = l + r >> 1;
~~^~~
pio.cpp: In function 'int main()':
pio.cpp:61:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
~~~~~^~~~~~~~~~
pio.cpp:63:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &a[i]);
~~~~~^~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
888 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
20 ms |
1320 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
23 ms |
1144 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
34 ms |
1672 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
77 ms |
3172 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
131 ms |
6620 KB |
Output is correct |
2 |
Correct |
110 ms |
4472 KB |
Output is correct |
3 |
Incorrect |
115 ms |
6648 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
184 ms |
9208 KB |
Output is correct |
2 |
Correct |
156 ms |
6264 KB |
Output is correct |
3 |
Incorrect |
162 ms |
9208 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
166 ms |
6776 KB |
Output is correct |
2 |
Incorrect |
151 ms |
6268 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |