hdu 1806线段树 区间合并

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int num[100005];
const int N=100005;

struct edge{
    int l,r;
    int num,count;
    int rnum,rcount;   //左值，左连续
    int lnum,lcount;   //右值，右连续
}s[4*N+1];

void pushup(int k){
    s[k].num=max(s[k<<1].num,s[k<<1|1].num);
    s[k].count=max(s[k<<1].count,s[k<<1|1].count);
    s[k].rnum=s[k<<1|1].rnum; s[k].rcount=s[k<<1|1].rcount;
    s[k].lnum=s[k<<1].lnum;s[k].lcount=s[k<<1].lcount;
    if(s[k<<1].rnum==s[k<<1|1].lnum){
        int ans=s[k<<1].rcount+s[k<<1|1].lcount;
        if(ans>s[k].count){
            s[k].num=s[k<<1].rnum;
            s[k].count=ans;
        }
        if(s[k<<1].lnum==s[k<<1|1].lnum) s[k].lcount+=s[k<<1|1].lcount;
        if(s[k<<1|1].rnum==s[k<<1].rnum) s[k].rcount+=s[k<<1].rcount;
    }

}

void bulid(int l,int r,int k){
    int mid=(l+r)>>1;
    if(l==r){
        s[k].l=s[k].r=l;
        s[k].num=s[k].rnum=s[k].lnum=num[l];
        s[k].count=s[k].rcount=s[k].lcount=1;
        return ;
    }
    s[k].l=l;
    s[k].r=r;
    bulid(l,mid,k<<1);
    bulid(mid+1,r,k<<1|1);
    pushup(k);
}

int ans=0;
void query(int l,int r,int k){
    if(s[k].l==l&&s[k].r==r){
        ans=max(ans,s[k].count);
        return ;
    }
    int mid=(s[k].l+s[k].r)>>1;
    if(r<=mid) query(l,r,2*k);
    else if(l>mid) query(l,r,2*k+1);
    else{
        query(l,mid,2*k);
        query(mid+1,r,2*k+1);
        if(s[k<<1].rnum==s[k<<1|1].lnum){
            int s1,s2;
            if(num[l]!=s[2*k].rnum) s1=s[2*k].rcount;
            else s1=mid-l+1;
            if(num[r]!=s[k<<1|1].lnum) s2=s[k<<1|1].lcount;
            else s2=r-mid;
            ans=max(ans,s1+s2);
        }
    }
}
int main()
{
    int n,m,i;
    while(scanf("%d",&n),n){
        scanf("%d",&m);
        for(i=1;i<=n;i++)  {
            scanf("%d",&num[i]);
        }
        bulid(1,n,1);
        for(i=1;i<=m;i++){
            int a,b;
            ans=0;
            scanf("%d%d",&a,&b);
            query(a,b,1);
            printf("%d\n",ans);
        }
    }
}