#4 WA,#19 TLE,太惨了。。。

代码如下：

#include<bits/stdc++.h>
#define ls tree[p].l
#define rs tree[p].r
#define N 300010
using namespace std;
int n,m,a[N],rt[N],cnt;
struct node{
	int l,r,sum;
} tree[N*60];
void build(int &p,int fa,int a,int l,int r){
	p=++cnt;
	tree[p]=tree[fa];
	tree[p].sum++;
	if(l==r) return;
	int mid=l+r>>1;
	if(a<=mid) build(ls,tree[fa].l,a,l,mid);
	else build(rs,tree[fa].r,a,mid+1,r);
}
void update(int &p,int fa,int a,int l,int r,int k){
	p=++cnt;
	tree[p]=tree[fa];
	tree[p].sum+=k;
	if(l==r) return;
	int mid=l+r>>1;
	if(a<=mid) update(ls,tree[fa].l,a,l,mid,k);
	else update(rs,tree[fa].r,a,mid+1,r,k);
}
int query(int l,int r,int a,int b,int c){
	if(l==r) return tree[b].sum-tree[a].sum;
	int mid=l+r>>1;
	if(c<=mid) return query(l,mid,tree[a].l,tree[b].l,c);
	else return query(mid+1,r,tree[a].r,tree[b].r,c);
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	for(int i=1;i<=n;i++) build(rt[i],rt[i-1],a[i],1,n);
	while(m--){
		int op;
		scanf("%d",&op);
		if(op==1){
			int l,r,c;
			scanf("%d%d%d",&l,&r,&c);
			printf("%d\n",query(1,n,rt[l-1],rt[r],c));
		}else{
			int x;
			scanf("%d",&x);
			int t1=a[x],t2=a[x+1];
			update(rt[x],rt[x-1],t1,1,n,-1);
			update(rt[x],rt[x-1],t2,1,n,1);
			swap(a[x],a[x+1]);
		}
	}
	return 0;
}