codeforces 622c（思维）

You are given array a with n integers and m queries. The i-th query is given with three integers li, ri, xi.

For the i-th query find any position pi (li ≤ pi ≤ ri) so that api ≠ xi.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 2·105) — the number of elements in a and the number of queries.

The second line contains n integers ai (1 ≤ ai ≤ 106) — the elements of the array a.

Each of the next m lines contains three integers li, ri, xi (1 ≤ li ≤ ri ≤ n, 1 ≤ xi ≤ 106) — the parameters of the i-th query.

Output

Print m lines. On the i-th line print integer pi — the position of any number not equal to xi in segment [li, ri] or the value  - 1 if there is no such number.

代码：

#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int a[200009];
int b[200009];
int main()
{
    int n,m;
   // cin>>n>>m;
   scanf("%d%d",&n,&m);
    a[0]=-1;
    for(int i=1;i<=n;i++)
    {
       // cin>>a[i];
       scanf("%d",&a[i]);
        if(a[i]!=a[i-1])
        {
            b[i]=i-1;
        }
        else
        {
            b[i]=b[i-1];
        }
    }
    int ll,rr,u;
  for(int i=1;i<=m;i++)
  {
     // cin>>ll>>rr>>u;
     scanf("%d%d%d",&ll,&rr,&u);
      if(a[rr]==u)
      {
          int ss=b[rr];
          if(ss<ll)
          {
              cout<<"-1"<<endl;
          }
          else
          {
              cout<<ss<<endl;
          }
      }
      else
      {
          cout<<rr<<endl;
      }
  }
}