Frequent values UVA - 11235

这个题目就是考察RMQ，本菜渣还是不太会写线段树，等会写了线段树以后，再做一下这个题目；这个题目用了，游标编码，然后对于出现的次数进行编码，然后，对于每个区间，都对应相应的次数，最后的时候，ans = max(Right[k1] - x + 1,y - Left[k2] + 1); ans = max(ans,RMQ(k1 + 1,k2 - 1)); 这是对于k2 - k1 > 1 的情况，当k2 - k1 = 1时只需要第一个公式就可以，具体的看代码吧写的比较菜

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <math.h>
#include <stack>
#include <utility>
#include <string>
#include <sstream>
#include <cstdlib>
#include <set>
#define LL long long
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 100000 + 10;
int dir[4][2] = {{1,0},{0,1},{-1,0},{0,-1}};
int count1[maxn];
int num[maxn];
int Left[maxn];
int Right[maxn];
int data[maxn];
int n;
int m;
int d[maxn][20];
void RMQ_init(int k)
{
	for(int i = 1;i <= k;i++)
		d[i][0] = count1[i];
	for(int j = 1;(1<<j) <= k;j++)
	{
		for(int i = 1;i + (1<<j) <= k;i++)
		{
			d[i][j] = max(d[i][j-1],d[i+(1<<(j - 1))][j - 1]);
		}
	}

}
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) && n)
	{
		scanf("%d",&m);
		for(int i = 1;i <= n;i++)
		{
			scanf("%d",&data[i]);
		}
		int k = 1;
		for(int i = 1;i <= n;i++)
		{
			Left[k] = i;
			num[i] = k;
			int cnt = 1;
			while(data[i] == data[i + 1])
			{
				cnt++;
				i++;
				num[i] = k;
			}
			Right[k] = i;
			count1[k] = cnt;
			k++;
		}
		RMQ_init(k-1);
		for(int i = 1;i <= m;i++)
		{
			int x,y;
			scanf("%d %d",&x,&y);
			int k1 = num[x];
			int k2 = num[y];
		    int ans = 0;
		    if(k1 == k2)
				printf("%d\n",y - x + 1);
			else if(k2 - k1 == 1)
			{
				ans = max(Right[k1] - x + 1,y - Left[k2] + 1);
				printf("%d\n",ans);
			}
			else if(k2 - k1 > 1)
			{
				ans = max(Right[k1] - x + 1,y - Left[k2] + 1);
				ans = max(ans,RMQ(k1 + 1,k2 - 1));
				printf("%d\n",ans);
			}
		}
	}
	return 0;
}