이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int n;
int h[500005];
int f[500005];
void rec(int l,int r,int optl,int optr)
{
if(l>r)return;
int i=(l+r)/2;
int opt=optl;
for(int j=optl;j<=min(i,optr);j++)
{
if(h[j]+sqrt(abs(i-j))>h[opt]+sqrt(abs(i-opt)))
{
opt=j;
}
}
f[i]=max(f[i],h[opt]+(int)ceil(sqrt(abs(i-opt)))-h[i]);
rec(l,i-1,optl,opt);
rec(i+1,r,opt,optr);
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> h[i];
}
rec(1,n,1,n);
reverse(h+1,h+n+1);
reverse(f+1,f+n+1);
rec(1,n,1,n);
for(int i=n;i>=1;i--)
{
cout << f[i]<<'\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |