2590694_tle.cc

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>

int n, q;
int a[100001], b[100001];

int main()
{
	int s, t, m;
	int i, l, r;

	while(scanf("%d",&n)==1,n)
	{
		scanf("%d",&q);
		for(i = 0; i < n; i++)
		{
			scanf("%d",&a[i]);
			if(!i||a[i]!=a[i-1])
				b[i] = i;
			else
				b[i] = b[i-1];
		}
		for(i = 0; i < q; i++)
		{
			scanf("%d%d",&l,&r);
			l--,r--;
			if(l==r)
				printf("1\n");
			else
			{
				m = -1;
				s = r;
				while(s>=l)
				{
					if(b[s]<l)
						t = s-l+1;
					else
						t = s-b[s]+1;
						if(t>m)
						m = t;
					s = b[s]-1;
				}
				printf("%d\n",m);
			}
		}
	}
	return 0;
}