O(nq)AC?
查看原帖
O(nq)AC?
285617
黑影洞人楼主2021/10/25 21:49
#include<cstdio>
#include<algorithm>
#define N 8005
using namespace std;
int a[N],n,q;
int main(){
	scanf("%d %d",&n,&q);
	for(int i=1;i<=n;i++)scanf("%d",a+i);
	for(int i=1,op,x,v,ans;i<=q;i++){
		scanf("%d %d",&op,&x);
		if(op==2){
            ans=0;
			for(int j=x;j>=1;j--)if(a[j]<=a[x])ans++;
			for(int j=x+1;j<=n;j++)if(a[j]<a[x])ans++;
			printf("%d\n",ans);
		}
        else{
            scanf("%d",&v);
            a[x]=v;
        }
	}
	return 0;
}



2021/10/25 21:49
加载中...