CodeForces - 811B

最新推荐文章于 2024-01-07 12:21:21 发布

闻道-问道

最新推荐文章于 2024-01-07 12:21:21 发布

阅读量354

点赞数

分类专栏：测试--水题文章标签：水题数学

本文链接：https://blog.csdn.net/a1046765624/article/details/76934327

版权

测试--水题专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Vladik had started reading a complicated book about algorithms containing n pages. To improve understanding of what is written, his friends advised him to read pages in some order given by permutation P = [p₁, p₂, ..., p_n], where p_i denotes the number of page that should be read i-th in turn.

Sometimes Vladik’s mom sorted some subsegment of permutation P from position l to position r inclusive, because she loves the order. For every of such sorting Vladik knows number x — what index of page in permutation he should read. He is wondered if the page, which he will read after sorting, has changed. In other words, has p_xchanged? After every sorting Vladik return permutation to initial state, so you can assume that each sorting is independent from each other.

Input

First line contains two space-separated integers n, m (1 ≤ n, m ≤ 10⁴) — length of permutation and number of times Vladik's mom sorted some subsegment of the book.

Second line contains n space-separated integers p₁, p₂, ..., p_n (1 ≤ p_i ≤ n) — permutation P. Note that elements in permutation are distinct.

Each of the next m lines contains three space-separated integers l_i, r_i, x_i (1 ≤ l_i ≤ x_i ≤ r_i ≤ n) — left and right borders of sorted subsegment in i-th sorting and position that is interesting to Vladik.

Output

For each mom’s sorting on it’s own line print "Yes", if page which is interesting to Vladik hasn't changed, or "No" otherwise.

Example

Input

Output

Yes
No
Yes
Yes
No

Input

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

Output

Yes
No
Yes
No
Yes

题目大概：

输出一段序列，给指定段重新排序，然后看指定位置的数字是否改变。

思路：

不能用排序，否则TLE。

代码：

#include <iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;

int n,m;
int a[10003];
int b[10003];

int main(){


cin>>n>>m;
int i=1;
while(i!=n+1)
{
     scanf("%d",&a[i]);

    b[i]=a[i];
    i++;
}


while(m--)
{



    int l,r,k;
    scanf("%d%d%d",&l,&r,&k);

    int sum=0;
    for(int i=l;i<=r;i++)
    {
        if(a[i]<a[k])sum++;
    }

    if(sum==k-l)printf("Yes\n");
    else printf("No\n");



}
    return 0;
}