3301464_ac_16ms_324k.cpp

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <algorithm>
#define max 10001

using namespace std;

struct node
{
	int l, r;

	bool operator < (const node &x)	const
	{
		if(l == x.l)
			return r < x.r;
		else
			return l < x.l;
	}
	bool operator == (const node &x)	const
	{
		return l == x.l && r == x.r;
	}
}s[max];

int h[max];

int main()
{
	int i, n, l, r, c, j, H;

	scanf("%d%d%d%d",&n,&l,&H,&r);
	for(i = 0; i < r; i++)
	{
		scanf("%d%d",&s[i].l,&s[i].r);
		s[i].l--;
		s[i].r--;
		if(s[i].l > s[i].r)
		{
			swap(s[i].l,s[i].r);
		}
	}
	sort(s,s+r);
	for(i = 0,c = 0; i < r; i++,c++)
	{
		s[c] = s[i];
		j = i;
		while(j < r&&s[j]==s[i])
			j++;
		i = j-1;
	}
	memset(h,0,sizeof(h));
	for(i = 0; i < c; i++)
	{
		h[s[i].l+1]--;
		h[s[i].r]++;
	}
	j = 0;
	for(i = 0; i < n; i++)
	{
		j += h[i];
		printf("%d\n",H+j);
	}
	return 0;
}