codeforces 171c

// File Name: 171c1.cpp// Author: rudolf// Created Time: 2013年03月05日 星期二 19:29:16#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>#include<stdio.h>#define MAX 100100using namespace std;int inc[MAX],dnc[MAX],a[MAX],cur;;int main(){    int n,m,i,j,l,r;    scanf("%d%d",&n,&m);    for(i=1;i<=n;i++)        scanf("%d",&a[i]);    cur=n;    inc[n]=n;    for(i=n-1;i>=1;i--)    {        if(a[i]>a[i+1])            cur=i;        inc[i]=cur;    }    cur=n;    dnc[n]=n;    for(i=n-1;i>=1;i--)    {        if(a[i]            cur=i;        dnc[i]=cur;    }    while(m--)    {        scanf("%d%d",&l,&r);        if(dnc[inc[l]]>=r)            printf("Yes\n");        else            printf("No\n");    }return 0;}http://codeforces.com/contest/279/problem/C