cf#ecr7-C. Not Equal on a Segment-线段树-rmq

给出n长度的序列，

m次查询，每次找出l,r之间不等于x的数的下标

线段树维护区间的rmq值，并且记录下rmq值对应的下标

每次找rmq(l,r)的最大最小值，如果都等于x，表示l到r全为x，输出-1，

否则，输出不等于x的那个最值对应的下标。

By liuyuhong, contest: Educational Codeforces Round 7, problem: (C) Not Equal on a Segment, Accepted, #
 #include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <iostream>
using namespace std;
#define lson l , m , rt << 1
#define rson m + 1 , r , rt << 1 | 1
const int inf=2147483647;
const double pi=acos(-1.0);
double eps=0.0000010;
int tm[100000*2];
int flag;
struct tree 
{
	int st_max[1000005*4];
	int st_min[1000005*4];
	int maxid[1000005*4];
	int minid[1000005*4];
	inline int minn(int a,int b) { return a>b?b:a; }
	inline int maxx(int a,int b) { return a>b?a:b; }
	void PushUP(int rt)
	{
		st_min[rt] = minn(st_min[rt<<1],st_min[rt<<1|1]);
		st_max[rt] = maxx(st_max[rt<<1],st_max[rt<<1|1]);
		if (st_max[rt<<1]>st_max[rt<<1|1])
			maxid[rt]=maxid[rt<<1];
		else
			maxid[rt]=maxid[rt<<1|1];
		
		if (st_min[rt<<1]<st_min[rt<<1|1])
			minid[rt]=minid[rt<<1];
		else
			minid[rt]=minid[rt<<1|1];
	}
	void build(int l,int r,int rt) 
	{
		if (l == r) 	
		{
			maxid[rt]=minid[rt]=r;
			st_max[rt]=	st_min[rt] =  tm[r];
			return ; 
		}
		int m = (l + r) >> 1;
		build(lson);
		build(rson);
		PushUP(rt);
	} 
	
	
	int query_min(int qL,int qR,int l,int r,int rt,int &id) //rt是节点编号
	{
		if (qL <= l && r <= qR) {
			id=minid[rt];
			return st_min[rt];
		}
		int m = (l + r) >> 1;
		int ret1 = inf,ret2 = inf;
		int id1,id2;
		if (qL <= m) ret1 = query_min(qL , qR , lson,id1);	//复杂情况可直接R<=m作return条件 省时
		if (qR > m) ret2 = query_min(qL , qR , rson,id2);
	 	if (ret1<ret2)
			id=id1;
		else
			id=id2;
		
		return minn(ret1,ret2);
	}
	int query_max(int qL,int qR,int l,int r,int rt,int &id) //L,R为为查询区间，lr当前区间
	{
		if (qL <= l && r <= qR) {
			id=maxid[rt];
			return st_max[rt];
		}
		int m = (l + r) >> 1;
		int ret1 = -inf,ret2 = -inf;
		int id1,id2;
		if (qL <= m) ret1 = query_max(qL , qR , lson,id1);
		if (qR > m) ret2 = query_max(qL , qR , rson,id2);
	 	if (ret1>ret2)
			id=id1;
		else
			id=id2; 
		return maxx(ret1,ret2);
	}
};

tree tp;
int main()
{  
	
	int n,m,aa; 
	scanf("%d%d",&n,&m); 
	int i;
	for (i=1;i<=n;i++)
	{
		scanf("%d",&tm[i]); 
	}
	tp.build(1,n,1);
	int l,r,x;
	for (i=1;i<=m;i++)
	{
		scanf("%d%d%d",&l,&r,&x);
		int id1,id2;
		int ret1=tp.query_min(l,r,1,n,1,id1);
		int ret2=tp.query_max(l,r,1,n,1,id2);
		if (ret1==ret2)
		{
			if (ret1==x)
				printf("-1\n");
			else
				printf("%d\n",r);
		}
		else
		{
			if (ret1!=x)
				printf("%d\n",id1);
			else
				printf("%d\n",id2);
		}
		
	}
	
	return 0;
	
}