CodeForces - 279C（求先非递增后非递减序列）

C. Ladder

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You've got an array, consisting of n integers a1, a2, ..., an. Also, you've got m queries, the i-th query is described by two integers li, ri. Numbers li, ri define a subsegment of the original array, that is, the sequence of numbers ali, ali + 1, ali + 2, ..., ari. For each query you should check whether the corresponding segment is a ladder.

A ladder is a sequence of integers b1, b2, ..., bk, such that it first doesn't decrease, then doesn't increase. In other words, there is such integer x (1 ≤ x ≤ k), that the following inequation fulfills: b1 ≤ b2 ≤ ... ≤ bx ≥ bx + 1 ≥ bx + 2... ≥ bk. Note that the non-decreasing and the non-increasing sequences are also considered ladders.

Input

The first line contains two integers n and m (1 ≤ n, m ≤ 105) — the number of array elements and the number of queries. The second line contains the sequence of integers a1, a2, ..., an (1 ≤ ai ≤ 109), where number ai stands for the i-th array element.

The following m lines contain the description of the queries. The i-th line contains the description of the i-th query, consisting of two integers li, ri (1 ≤ li ≤ ri ≤ n) — the boundaries of the subsegment of the initial array.

The numbers in the lines are separated by single spaces.

Output

Print m lines, in the i-th line print word "Yes" (without the quotes), if the subsegment that corresponds to the i-th query is the ladder, or word "No" (without the quotes) otherwise.

Examples

input

Copy

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

output

Copy

Yes
Yes
No
Yes
No
Yes

【method】

用户给出的数组数据逐个分析，记录每个数据ai的两个数据，即在ai左边且递减的数的个数和在ai右边且递增的数的个数，然后只要查询的长度l - r小于等于查询的递减的数的个数加递增的数的个数即输出Yes，否则输出No。

【AC代码】

#include <cstdio>
using namespace std;
int n,m;
int a[100005];
int mp[100005][2];
int l[100005],r[100005];
int main()
{
    scanf("%d%d",&n,&m); //个人是不喜欢用scanf的，但是确实快啊
    for(int i=0;i<=n-1;i++)
    {
        scanf("%d",&a[i]);
    }
    for(int i=0;i<=m-1;i++)
    {
        scanf("%d%d",&l[i],&r[i]);
    }
    for(int i=0;i<=n-1;i++)
    {
        if(i!=0)
        {
            if(a[i]<=a[i-1])
                mp[i][0]=mp[i-1][0]+1;
            else
                mp[i][0]=0;
        }
    }
    for(int i=n-1;i>=0;i--)
    {
        if(i!=n-1)
        {
            if(a[i]<=a[i+1])
                mp[i][1]=mp[i+1][1]+1;
            else
                mp[i][1]=0;
        }
    }
    for(int i=0;i<m;i++)
    {
        int len=r[i]-l[i];
        if(l[i]-r[i]==0||l[i]-r[i]==1)
            printf("%s\n","Yes");
        else if(len<=mp[l[i]-1][1]+mp[r[i]-1][0])
			printf("%s\n","Yes");
			else
            printf("%s\n","No");
    }
    return 0;
}