[USACO07JAN]区间统计Tallest Cow 差分

#include <bits/stdc++.h>
using namespace std;
int dif[10005];
map<pair<int,int>,bool> book;
int main()
{
	int h,n,r,i;
	int x,y;
	scanf("%d %d %d %d",&n,&i,&h,&r);
	while(r--){
		scanf("%d %d",&x,&y);
		if(x>y)swap(x,y);
		if(book[make_pair(x,y)])continue;
		book[make_pair(x,y)]=1;
		dif[x+1]--;
		dif[y]++;
	}
	for(i=1;i<=n;i++){
		dif[i]=dif[i-1]+dif[i];
		printf("%d\n",dif[i]+h);
	}
	return 0;
}