详情训练指南,需要注意就2个特殊情况,一个已经书中已经指出。另一个特殊情况
if (num[R]-num[L]==1) {printf("%d\n",ans);continue;}
#include <map>
#include <set>
#include <list>
#include <cmath>
#include<cctype>
#include <ctime>
#include <deque>
#include <stack>
#include <queue>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#define LL long long
#define PI 3.1415926535897932626
using namespace std;
int gcd(int a, int b)
{
return a % b == 0 ? b : gcd(b, a % b);
}
#define MAXN 100010
int value[MAXN],Count[MAXN],num[MAXN],Left[MAXN],Right[MAXN];
int N ,Q;
int cnt;
int d[MAXN][20];
void read(int n)
{
cnt=0;int input;
int cas=1;
scanf("%d",&Q);
scanf("%d",&value[0]);Count[0]++;num[0]=0;Left[0]=0;Right[0]=0;int l,r;l=0;r=0;//µ±Ç°×óÓҶ˵ã
for (int i=1;i<n-1;i++)
{
scanf("%d",&input);
if (input==value[cnt])
{
cas++;
Left[i]=l;
}
else
{
for (int j=l,k=0;k<cas;k++,j++)
Right[j]=i-1;
Left[i]=i;
l=i;
Count[cnt]=cas;
cas=1;
cnt++;
Count[cnt]=1;
value[cnt]=input;
}
num[i]=cnt;
}
scanf("%d",&input);//printf("%d\n",l);
if (input==value[cnt])
{
for (int j=l,k=0;k<=cas;k++,j++)
Right[j]=n-1;
Left[n-1]=l;
Count[cnt]=cas+1;
num[n-1]=cnt;
}
else
{
for (int j=l;j<n-1;j++)
Right[j]=n-2;
Left[n-1]=n-1;
Right[n-1]=n-1;
Count[++cnt]=1;
num[n-1]=cnt;
}
// printf("%d\n",cnt);
// for (int i=0;i<=cnt;i++)
// printf("%d %d\n",value[i],Count[i]);
// for (int i=0;i<N;i++) printf("%d %d %d \n",num[i],Left[i],Right[i]);
}
inline void init_RMQ()
{
for (int i=0;i<=cnt;i++) d[i][0]=Count[i];
for (int j=1;(1<<j)<=cnt+1;j++)
for (int i=0;i+(1<<j)-1<=cnt;i++)
d[i][j]=max(d[i][j-1],d[i+(1<<(j-1))][j-1]);
}
inline int RMQ(int L,int R)
{
int k=0;
while (1<<(k+1)<=R-L+1) k++;
return max(d[L][k],d[R-(1<<k)+1][k]);
}
int main()
{
while (scanf("%d",&N)==1)
{
if (N==0) break;
memset(d,0,sizeof(d));
read(N);
init_RMQ();
while (Q--)
{
int L,R;
scanf("%d%d",&L,&R);L--;R--;
if (num[L]==num[R]) {printf("%d\n",R-L+1);continue;}
int ans=max(Right[L]-L+1,R-Left[R]+1);
if (num[R]-num[L]==1) {printf("%d\n",ans);continue;}
ans=max(ans,RMQ(num[L]+1,num[R]-1));
//printf("%d %d %d\n",Right[L]-L+1,R-Left[R]+1,RMQ(num[L]+1,num[R]-1));
printf("%d\n",ans);
}
}
return 0;
}