POJ 3368 线段树

题意

传送门 POJ 3368

题解

元素单调不递减，保证了相同元素位置的连续性。考虑到当左子树维护的区间最右侧元素与右子树维护的区间最左侧元素相等时，左子树与右子树中此元素的频率值相加的值可能大于左子树或右子树中元素的最大频率；故线段树一共维护 $5$ 个值，区间最左侧元素及其频率，区间最右侧元素及其频率，区间内元素的最大频率。

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define min(a,b)    (((a) < (b)) ? (a) : (b))
#define max(a,b)    (((a) > (b)) ? (a) : (b))
#define abs(x)    ((x) < 0 ? -(x) : (x))
#define INF 0x3f3f3f3f
#define delta 0.85
#define eps 1e-5
#define PI 3.14159265358979323846
#define MAX_N 100005
using namespace std;
struct segment{
	// 区间最左侧元素及其频率，区间最右侧元素及其频率，区间内元素的最大频率
	int l, fl, r, fr, fm;
	segment(int l, int fl, int r, int fr, int fm):l(l), fl(fl), r(r), fr(fr), fm(fm){}
	segment(){}
};
const int ST_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
segment st[ST_SIZE];

void init(int k, int l, int r){ // [l, r)
	if(r - l == 1) st[k] = segment(A[l], 1, A[l], 1, 1);
	else{
		int chl = (k << 1) + 1, chr = (k << 1) + 2, m = (l + r) >> 1;
		init(chl, l, m);
		init(chr, m, r);
		segment &cl = st[chl], &cr = st[chr];
		int fl = cl.fl, fr = cr.fr, fm = max(cl.fm, cr.fm);
		if(cl.r == cr.l){
			fm = max(fm, cl.fr + cr.fl);
			// 考虑区间最左侧元素与最右侧元素相等的情况
			if(cl.l == cl.r) fl += cr.fl;
			if(cr.l == cr.r) fr += cl.fr;
		}
		st[k] = segment(cl.l, fl, cr.r, fr, fm);
	}
}

segment query(int a, int b, int k, int l, int r){
	if(b <= l || r <= a) return segment(INF, 0, INF, 0, 0);
	else if(a <= l && r <= b) return st[k];
	else{
		int chl = (k << 1) + 1, chr = (k << 1) + 2, m = (l + r) >> 1;
		segment cl = query(a, b, chl, l, m), cr = query(a, b, chr, m, r);
		int fl = cl.fl, fr = cr.fr, fm = max(cl.fm, cr.fm);
		if(cl.r == cr.l){
			fm = max(fm, cl.fr + cr.fl);
			if(cl.l == cl.r) fl += cr.fl;
			if(cr.l == cr.r) fr += cl.fr;
		}
		return segment(cl.l, fl, cr.r, fr, fm);
	}
}

int main(){
	while(~scanf("%d", &N) && N){
		scanf("%d", &Q);
		for(int i = 0; i < N; i++) scanf("%d", A + i);
		init(0, 0, N);
		for(int i = 0; i < Q; i++){
			int a, b;
			scanf("%d%d", &a, &b);
			segment s = query(a - 1, b, 0, 0, N);
			printf("%d\n", s.fm);
		}
	}
	return 0;
}