#include<iostream>
#include<cstdio>
#include<string>
#include<string.h>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 100005;
int d[maxn];
int f[maxn];
int r[maxn][20];
void ST(int n){
int k = (log((double)(n + 1))) / log(2.0);
for(int i = 1; i <= n; ++i){
r[i][0] = f[i];
}
for(int j = 1; j <= k; ++j){
for(int i = 1; i + (1 << j) - 1 <= n; ++i){
r[i][j] = max(r[i][j-1], r[i + (1<<(j - 1))][j-1]);
}
}
}
int rmq_max(int left, int right){
if(left > right){
return 0;
}
int tmpk = (log((double)(right - left + 1))) / log(2.0);
return max(r[left][tmpk], r[right - (1 << tmpk) + 1][tmpk]);
}
int main(){
int n,q;
while(scanf("%d", &n) && n){
scanf("%d", &q);
for(int i = 1; i <= n; ++i){
scanf("%d", d + i);
if(i == 1){
f[i] = 1;
continue;
}
if(d[i] == d[i-1]){
f[i] = f[i-1]+1;
}
else{
f[i] = 1;
}
}
ST(n);
int a, b;
for(int i = 0; i < q; ++i){
scanf("%d%d",&a,&b);
int t = a;
while(t <= b && d[t] == d[t-1]){
t++;
}
int ans = max(t - a, rmq_max(t, b));
printf("%d\n",ans);
}
}
return 0;
}
转载于:https://my.oschina.net/u/1421373/blog/379530