Educational Codeforces Round 7 C. Not Equal on a Segment

最新推荐文章于 2023-03-13 16:03:25 发布

AnICoo1

最新推荐文章于 2023-03-13 16:03:25 发布

阅读量439

点赞数

分类专栏：技巧

本文链接：https://blog.csdn.net/helloiamclh/article/details/50651782

版权

技巧专栏收录该内容

60 篇文章 0 订阅

订阅专栏

You are given array a with n integers and m queries. Thei-th query is given with three integers l_i, r_i, x_i.

For the i-th query find any position p_i (l_i ≤ p_i ≤ r_i) so thata_{p_i} ≠ x_i.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 2·10⁵) — the number of elements ina and the number of queries.

The second line contains n integers a_i (1 ≤ a_i ≤ 10⁶) — the elements of the arraya.

Each of the next m lines contains three integersl_i, r_i, x_i (1 ≤ l_i ≤ r_i ≤ n, 1 ≤ x_i ≤ 10⁶) — the parameters of the i-th query.

Output

Print m lines. On the i-th line print integer p_i — the position of any number not equal tox_i in segment[l_i, r_i] or the value - 1 if there is no such number.

Sample test(s)

Input

6 4
1 2 1 1 3 5
1 4 1
2 6 2
3 4 1
3 4 2

Output

题意：给你一个序列，然后问在[l,r]范围内不和x相同的数字的位置

思路：用一个数组记录下一个遍历的点是哪个，也就是说将相同的数字分块，当遍历到一个点后，如果不符合直接跳到其分块的起始点前的那一位再开始。。

ac代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<stack>
#include<set>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#define MAXN 1010000
#define LL long long
#define ll __int64
#define INF 0xfffffff
#define mem(x) memset(x,0,sizeof(x))
#define PI acos(-1)
using namespace std;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
LL powmod(LL a,LL b,LL MOD){LL ans=1;while(b){if(b%2)ans=ans*a%MOD;a=a*a%MOD;b/=2;}return ans;}
//head
int a[MAXN];
int p[MAXN];
int main()
{
	int n,m;
	int i;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		int q=1;
		for(i=1;i<=n;i++)//初始化
		p[i]=i;
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==a[i-1])
			{
				p[i]=p[i-1];
			}
		}
		while(m--)
		{
			int l,r,x;
			scanf("%d%d%d",&l,&r,&x);
			int k=r;
			int bz=0;
			while(k>=l)
			{
				if(a[k]!=x)
				{
					printf("%d\n",k);
					bz=1;
					break;
				}
				k=p[k]-1;
			}
			if(!bz)
			printf("-1\n");
		}
	}
	return 0;
}