Codeforces Round #271 (Div. 2) E题 Pillars（线段树维护DP）_html/css_WEB-ITnose

#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <stdlib.h>#include <math.h>#include <ctype.h>#include <queue>#include <map>#include <set>#include <algorithm>using namespace std;#define LL __int64#define lson l, mid, rt=maxv[rt>1;    if(p=r)    {        if(q_maxv<maxv q_maxv="maxv[rt];" q_maxp="maxp[rt];" return int mid="l+r">>1, ans=0;    if(llmid) query(ll,rr,rson);}int bin_seach(LL x){    int low=0, high=cnt-1, mid;    while(low>1;        if(d[mid]==x) return mid;        else if(d[mid]>x) high=mid-1;        else low=mid+1;    }}int l_seach(LL x){    int low=0, high=cnt-1, mid, ans=-1;    while(low>1;        if(d[mid]>1;        if(d[mid]>=x)        {            ans=mid;            high=mid-1;        }        else low=mid+1;    }    return ans;}void print(int x){    if(x==-1) return ;    print(pre[x]);    printf("%d ",x+1);}int main(){    int n, dd, i, x, ans, y, z, max1=-1, pos, tot;    scanf("%d%d",&n,&dd);    for(i=0; i<n i scanf c sort d cnt="1;" for if printf puts memset x="bin_seach(a[i]);" y="l_seach(a[i]-dd);" z="r_seach(a[i]+dd);" q_maxp="-1;" q_maxv="-1;" query update pre max1="q_maxv+1;" pos="i;" print return>  <br>  <br>  <p></p> </n></maxv></algorithm></set></map></queue></ctype.h></math.h></stdlib.h></cstring></string></cstdio></iostream>