分块
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,q,t,m,a[1000001],b[1000001],pos[1000001],add[1000001];
void reset(int x){
int l=(x-1)*t+1,r=min(x*t,n);
for(int i=l;i<=r;i++)b[i]=a[i];
sort(b+l,b+r+1);......
阅读全文