14491：我也不知道题目名字是什么

#include<cstdio>

typedef long long ll;
template<class T>
inline void read(T&x)
{
    x=0;bool f=0;char c=getchar();
    while((c<'0'||c>'9')&&c!='-') c=getchar();if(c=='-')f=1, c=getchar();
    while(c>='0'&&c<='9'){x=x*10+c-'0'; c=getchar();}
    x=f?-x:x;
}
const int MAXN(50010);
int n,l,r,Ans,a[MAXN],T[MAXN],R[MAXN],L[MAXN],Q;
int max(int a,int b){return a>b?a:b;}
int F[20][MAXN],logg[MAXN];
void DealRMQ()
{
    for(int i=2;i<=n;i++)logg[i]=logg[i>>1]+1;
    for(int i=1;i<=n;i++)F[0][i]=R[i];
    for(int j=1;j<=logg[n];j++)
    for(int i=1;i<=n;i++)
    {
        int w=1<<(j-1); if(i+w>n)break;
        F[j][i]=max(F[j-1][i],F[j-1][i+w]);
    }
}
int Ask(int l,int r)
{
    int k=logg[r-l+1];   int w=1<<k;
//    fprintf(stderr,"%d %d\n",F[k][l],F[k][r-w+1]);
    return max(F[k][l],F[k][r-w+1]);
}
int main()
{
//    freopen("C.in","r",stdin);
    read(n);
    for(int i=1;i<=n;i++)read(a[i]);
    for(int i=n;i>=1;i--) T[i]=1+(a[i+1]>=a[i])*T[i+1],R[i]=max(R[i],T[i]);
    for(int i=n;i>=1;i--) T[i]=1+(a[i+1]<=a[i])*T[i+1],R[i]=max(R[i],T[i]);    
    for(int i=1;i<=n;i++) T[i]=1+(a[i-1]<=a[i])*T[i-1],L[i]=max(L[i],T[i]);
    for(int i=1;i<=n;i++) T[i]=1+(a[i-1]>=a[i])*T[i-1],L[i]=max(L[i],T[i]);
//    for(int i=1;i<=n;i++)
//    printf("i:%d\n L:%d\n  R:%d\n",i,L[i],R[i]);
    DealRMQ();
    read(Q);
    for(int i=1;i<=Q;i++)
    {
        read(l);read(r);
        if(r-L[r]+1<=l)Ans=r-l+1;
        else 
        {
            Ans=L[r];     r=r-L[r];
//            fprintf(stderr,"l:%d r%d\n",l,r);
            Ans=max(Ans,Ask(l,r));
        }
        printf("%d\n",Ans);
    }
    return 0;
}