bzoj4850 [Jsoi2016]灯塔（决策单调性）

同bzoj2216

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 500010
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,a[N],f[N],g[N];
struct Icefox{
    int id,l,r;
    Icefox(int _l=0,int _r=0,int _id=0){id=_id;l=_l;r=_r;}
}q[N];
inline double calc(int j,int i){
    return a[j]+sqrt(abs(i-j));
}
inline int ask(Icefox x,int k2){
    int l=x.l,r=x.r,k1=x.id;
    while(l<=r){
        int mid=l+r>>1;
        if(calc(k1,mid)>=calc(k2,mid)) l=mid+1;
        else r=mid-1;
    }return l-1;
}
inline void dp(int *F){
    int qh=1,qt=0;
    for(int i=1;i<=n;++i){
        if(qh<=qt&&q[qh].r<i) ++qh;
        if(qh<=qt) q[qh].l++;
        if(qh>qt||calc(q[qt].id,n)<=calc(i,n)){
            while(qh<=qt&&calc(q[qt].id,q[qt].l)<=calc(i,q[qt].l)) --qt;
            if(qh<=qt){
                int res=ask(q[qt],i);
                q[qt].r=res;q[++qt]=Icefox(res+1,n,i);
            }else q[++qt]=Icefox(i+1,n,i);
        }F[i]=ceil(calc(q[qh].id,i));
    }
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();for(int i=1;i<=n;++i) a[i]=read();
    dp(f);reverse(a+1,a+n+1);dp(g);reverse(a+1,a+n+1);reverse(g+1,g+n+1);
    for(int i=1;i<=n;++i) printf("%d\n",max(f[i],g[i])-a[i]);
    return 0;
}