B. Vladik and Complicated Book

最新推荐文章于 2022-01-28 13:05:09 发布

free-dancer

最新推荐文章于 2022-01-28 13:05:09 发布

阅读量380

点赞数

CC 4.0 BY-SA版权

分类专栏：练习pic

本文链接：https://blog.youkuaiyun.com/Joined/article/details/76944723

练习pic 专栏收录该内容

9 篇文章

订阅专栏

本文介绍了一个关于书页排序的问题，需要判断在特定排序操作后，指定位置的书页是否发生变化。通过对原始序列的操作而不直接排序，高效解决了问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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_x changed? 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.

Examples

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

Note

Explanation of first test case:

[1, 2, 3, 4, 5] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
[3, 4, 5, 2, 1] — permutation after sorting, 1-st element has changed, so answer is "No".
[5, 2, 3, 4, 1] — permutation after sorting, 3-rd element hasn’t changed, so answer is "Yes".
[5, 4, 3, 2, 1] — permutation after sorting, 4-th element hasn’t changed, so answer is "Yes".
[5, 1, 2, 3, 4] — permutation after sorting, 3-rd element has changed, so answer is "No".

题意：第一行，书的页数，和书页变化的次数，给出一个书的顺序

给出变换的是这样变的：给出变化的下标（第几页到第几页） left 和 right，还有一个变量p，这个区间从小到大排序，看看第 p 个点，的值有没有变。

如果用的 sort 把区间排序，会超时。

//2.
#if 0
#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,t,a[10000];
	
while(cin>>n>>t)
{
	
	for(int i=1; i<=n; i++)
	{
		cin>>a[i];	
	}
	
	while(t--)
	{
		
		int l,r,p;
		cin>>l>>r>>p;
		
		
		if(p<l&&p>r)
		{
			cout<<"Yes"<<endl;
		}
		else
		{
			
		int c[10000]={0},d[10000]={0},num=0;
		for(int i=l; i<=r; i++) 
		{
			if(a[i]<a[p])
				num++; 
		}
		
		if(a[p]==a[l+num]) 
		{
			cout<<"Yes"<<endl;
		}
		else
		{
			cout<<"No"<<endl;
		}
	
		
	//	sort(c,c+(r-l+1));
		
	/*	for(int i=0; i<l-1; i++)
		{
			d[i]=a[i];
		}
		
		for(int i=l-1; i<=r-1; i++)
		{
			d[i]=c[i-l+1];
		}
		for(int i=r; i<n; i++)
		{
			d[i]=a[i];
		}
		
	/*	for(int i=0; i<n; i++)
		{
			cout<<d[i];
		}
		cout<<endl;
	*/
	
		
		
		}
	
	}
}
}
#endif