1 solutions

  • 0
    @ 2025-12-3 8:19:18

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    int n,m,x,s,t,a[505][50005],b[50005];
    int main()
    {
    	cin>>n;
    	for(int i=1;i<=n;i++)
    		scanf("%d",&b[i]);
    	for(int i=0;i<=500;i++)
    	{
    		int tmp=0;
    		for(int j=1;j<=n;j++)
    		{
    			if(b[j]==i) tmp++;
    			a[i][j]=tmp;
    		}
    	}
    	cin>>m;
    	while(m--)
    	{
    		scanf("%d%d",&s,&t);
    		int tmp=min(b[s],b[t]),bj=0;
    		for(int i=tmp+1;i<=500;i++)
    		{
    			int w=a[i][t-1]-a[i][s];
    			if(w>0) {bj=1;break;}
    		}
    		if(bj==1) printf("no\n");
    		else printf("yes\n");
    	}
    	return 0;
    }
    
    • 1

    Information

    ID
    734
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    8
    Tags
    # Submissions
    20
    Accepted
    5
    Uploaded By