bzoj 1635: [Usaco2007 Jan]Tallest Cow 最高的牛

1635: [Usaco2007 Jan]Tallest Cow 最高的牛

Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 647 Solved: 396
[Submit][Status][Discuss]

Description

FJ's N (1 <= N <= 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You are told only the height H (1 <= H <= 1,000,000) of the tallest cow along with the index I of that cow. FJ has made a list of R (0 <= R <= 10,000) lines of the form "cow 17 sees cow 34". This means that cow 34 is at least as tall as cow 17, and that every cow between 17 and 34 has a height that is strictly smaller than that of cow 17. For each cow from 1..N, determine its maximum possible height, such that all of the information given is still correct. It is guaranteed that it is possible to satisfy all the constraints.

有n(1 <= n <= 10000)头牛从１到n线性排列，每头牛的高度为h[i](1 <= i <= n),现在告诉你这里面的牛的最大高度为maxH,而且有r组关系，每组关系输入两个数字，假设为a和b,表示第a头牛能看到第b头牛，能看到的条件是a, b之间的其它牛的高度都严格小于min(h[a], h[b]),而h[b] >= h[a]

Input

* Line 1: Four space-separated integers: N, I, H and R

* Lines 2..R+1: Two distinct space-separated integers A and B (1 <= A, B <= N), indicating that cow A can see cow B.

Output

* Lines 1..N: Line i contains the maximum possible height of cow i.

Sample Input

9 3 5 5

1 3

5 3

4 3

3 7

9 8

Sample Output

输出每头牛可能的最高高度

第一行四个数分别表示有n头牛，第i头牛最高，高度为h，总共有m对关系

如果一头牛被包在k个范围内，那么这头牛的高度就是h-k，所以可以统计一下前缀和

对于关系(x, y)，若x>y则交换，然后cnt[x+1]--, cnt[y]++，不过注意判重！

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct Cow
{int x;int y;bool operator < (const Cow &b) const{if(x<b.x || x==b.x && y<b.y)return 1;return 0;}
}Cow;
Cow s[10005];
int cnt[10005];
int main(void)
{int sum, n, h, m, i;scanf("%d%*d%d%d", &n, &h, &m);for(i=1;i<=m;i++){scanf("%d%d", &s[i].x, &s[i].y);if(s[i].x>s[i].y)swap(s[i].x, s[i].y);}sort(s+1, s+m+1);for(i=1;i<=m;i++){if(s[i].x==s[i-1].x && s[i].y==s[i-1].y)continue;cnt[s[i].x+1]--, cnt[s[i].y]++;}sum = h;for(i=1;i<=n;i++){sum += cnt[i];printf("%d\n", sum);}return 0;
}