UVA - 11235

#include <bits/stdc++.h>

using namespace std;
const int maxn=100000+100;
int num[maxn];
int L[maxn];
int R[maxn];
int value[maxn];
int coun[maxn];
int v[maxn];
int d[maxn][1000];
int n,q;
void int_RMQ(int k)
{
    for(int i=0; i<k; i++)
        d[i][0]=coun[i];
    for(int j=1; (1<<j)<=k; j++)
        for(int i=0; i+(1<<j)-1<k; i++)
            d[i][j]=max(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
int main()
{
    while(cin>>n&&n)
    {memset(coun,0,sizeof(coun));
    memset(d,0,sizeof(d));
        cin>>q;
        for(int i=1; i<=n; i++)
        {
            cin>>v[i];
        }
        L[0]=1;
        num[1]=0;
        int a=1,b=1;
        int k=0;
        coun[0]++;
        for(int i=2; i<=n; i++)
            if(v[i]!=v[i-1])
            {   R[k]=i-1;
                k++;
                L[k]=i;
                coun[k]++;
                num[i]=k;
            }
            else
            {
                coun[k]++;
                num[i]=k;
            }
            int_RMQ(k+1);

            int l,r;
            while(q--)
            {
                cin>>l>>r;
                if(l==r){cout<<'1'<<endl;continue;}
                else if(num[l]==num[r]){cout<<r-l+1<<endl;continue;}
                int maxn=max(R[num[l]]-l+1,r-L[num[r]]+1);
                int m=0;
                while((1<<(1+m))<=(num[r]-1-num[l]-1+1))m++;
                if(num[l]+1<=num[r]-1)
                maxn=max(maxn,max(d[num[l]+1][m],d[num[r]-(1<<m)][m]));
                cout<<maxn<<endl;
            }
    }
}