POJ3263 Tallest Cow

#include<iostream>
#include<cstdio>
#include<cstring>
#include<map>
#include<utility>
using namespace std;
int a[10010], b[10010];
map<pair<int,int>,bool> existed;
int main()
{
	int n, i, h, r, x, y;
	cin>>n>>i>>h>>r;
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
	a[0] = h;
	for(int i = 0; i < r; i++){
		scanf("%d%d",&x,&y);
		if(x > y){
			swap(x,y);
		}
		if(existed[make_pair(x,y)]) continue;
		b[x+1]--, b[y]++;
		existed[make_pair(x,y)] = true;
	}
	for(int i = 1; i <= n; i++){
		a[i] = a[i-1] + b[i];
		printf("%d\n",a[i]);
	}
	return 0;
}