nefu_1506 rmq 区间众数

此题是有序的区间众数问题

可将数列变为频度序列，然后rmq求区间最大值，同时处理左边可能有只有一段在这个区间的情况，预处理数列，求出每个上升序列的起点值，然后减出，左边这段在区间内的长度。

代码：

#include <iostream>

#include <cstdio>

#include <cmath>

const int MAXN = 1e6 + 7;

using namespace std;

int a[MAXN], b[MAXN][21], c[MAXN], T, n, m;

void build() {

	for (int i = 1; i < 21; i++) {

		for (int j = 1; j + (1 << i) - 1 <= n; j++) {

			b[j][i] = max(b[j][i - 1], b[j + (1 << (i - 1) ) ][i - 1]);

		}

	}

}

int RMQ(int st, int en) {

	int len = en - st + 1, k = -1;

	k = log(len)/log(2.0);

	//while (len) { len /= 2; k++; }

	return max(b[st][k], b[en - (1 << k) + 1][k]);

}

int solve(int st, int en) {

	return c[st] < en ? max(c[st] - st + 1, RMQ(c[st] + 1, en)) : en - st + 1;

}

int main()

{

	//freopen("data.in", "r", stdin);

	//freopen("data.out", "w", stdout);

	scanf("%d", &T);

	while (T--) {

		scanf("%d", &n);

		a[0] = -1;

		for (int i = 1; i <= n; i++) {

			scanf("%d", &a[i]);

			if (a[i] != a[i - 1]) {

				b[i][0] = 1;

			}

			else {

				b[i][0] = b[i - 1][0] + 1;

			}

		}

		build();

		for (int i = n; i > 0; ) {

			int x = b[i][0], pos = i;

			while (x--) {

				c[i] = pos;

				i--;

			}

		}

		scanf("%d", &m);

		while (m--) {

			int x, y;

			scanf("%d%d", &x, &y);

			printf("%d\n", solve(x, y));

		}

	}

}

可以用线段树区间合并解这道题，，但是时间复杂度是rmq的两倍：

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int M=1e6+10;
int n,m;
int a[M];
struct node
{
    int lsum,rsum,sum,len;
    int r,l;
}trie[M*4];
void pushup(int i)
{
    if(trie[i*2].lsum==trie[i*2].len&&trie[i*2].r==trie[i*2+1].l)
    trie[i].lsum=trie[i*2].lsum+trie[i*2+1].lsum;
    else
        trie[i].lsum=trie[i*2].lsum;
     if(trie[i*2+1].rsum==trie[i*2+1].len&&trie[i*2+1].l==trie[i*2].r)
    trie[i].rsum=trie[i*2].rsum+trie[i*2+1].rsum;
    else
         trie[i].rsum=trie[i*2+1].rsum;
    int t=0;
    if(trie[i*2].r==trie[i*2+1].l)
        t=trie[i*2].rsum+trie[i*2+1].lsum;
    trie[i].sum=max(max(trie[i*2].sum,trie[i*2+1].sum),t);
    trie[i].l=trie[i*2].l;
    trie[i].r=trie[i*2+1].r;
}
void build(int i,int l,int r)
{
    trie[i].len=r-l+1;
    if(l==r)
    {
        trie[i].l=a[l];
        trie[i].r=a[r];
        trie[i].lsum=1;
        trie[i].rsum=1;
        trie[i].sum=1;
        return;
    }
    int mid=(l+r)/2;
    build(i*2,l,mid);
    build(i*2+1,mid+1,r);
    pushup(i);
}
int query(int i,int l,int r,int x,int y)
{
    if(x<=l&&y>=r)
    {
        return trie[i].sum;
    }
    int mid=(r+l)/2;
    if(y<=mid) return query(i*2,l,mid,x,y);
    if(x>mid) return query(i*2+1,mid+1,r,x,y);
    int ls=query(i*2,l,mid,x,y);
    int rs=query(i*2+1,mid+1,r,x,y);
    int lll=trie[i*2].rsum;
    if(lll>mid-x+1) lll=mid-x+1;
    int rrr=trie[i*2+1].lsum;
    if(rrr>y-(mid+1)+1) rrr=y-(mid+1)+1;
    int tsum=0;
    if(trie[i*2].r==trie[i*2+1].l)
         tsum=lll+rrr;
    return max(max(ls,rs),tsum);
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {

        int n;
        scanf("%d",&n);
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        build(1,1,n);
        int q;
        scanf("%d",&q);
        while(q--)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            if(x>y)
                swap(x,y);
            printf("%d\n",query(1,1,n,x,y));
        }
    }
    return 0;
}