此文为博主原创题解，转载时请通知博主，并把原文链接放在正文醒目位置。
题目链接：https://www.luogu.org/problem/show?pid=2879
题目描述
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.
给出牛的可能最高身高，然后输入m组数据 a b,代表a，b可以相望，最后求所有牛的可能最高身高输出
输入输出格式
输入格式：
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.
输出格式：
Lines 1..N: Line i contains the maximum possible height of cow i.
输入输出样例
输入样例#1：
9 3 5 5 1 3 5 3 4 3 3 7 9 8
输出样例#1：
5 4 5 3 4 4 5 5 5 分析：一个差分题。每当有奶牛能互相看到，就从靠前的奶牛做下标记，靠后的奶牛解除标记。注意要去重。统计答案时再按照标记计算身高。 AC代码：
1 //FJ Tallest Cow
2 #include<iostream>
3 #include<cstdio>
4 #include<algorithm>
5 #include<cmath>
6
7 using namespace std;
8 int cow[10005];
9
10 struct c
11 {
12 int a,b;
13 }sign[10005];
14 struct c tmp1,tmp2;
15
16 int cmp(c tmp1,c tmp2)
17 {
18 if(tmp1.a== tmp2.a)
19 return tmp1.b < tmp2.b;
20 return tmp1.a < tmp2.a;
21 }
22
23 int main()
24 {
25 int n,h,I,r,a,b,tmp = 0;
26 scanf("%d%d%d%d",&n,&I,&h,&r);
27 //实际上I并没有什么用
28 for(int i = 1;i <= r;i ++)
29 {
30 scanf("%d%d",&sign[i].a,&sign[i].b);
31 if(sign[i].a > sign[i].b) swap(sign[i].a,sign[i].b);
32 //交换位置，保证a<b
33 }
34 sort(sign + 1,sign + r +1,cmp);
35 for(int i = 1;i <= r;i ++)
36 {
37 if(sign[i].a == sign[i+1].a && sign[i].b == sign[i+1].b) continue;//判重
38 cow[sign[i].a + 1] ++,cow[sign[i].b] --;//标记
39 }
40 for(int i = 1;i <= n;i ++)
41 {
42 tmp += cow[i];
43 printf("%d\n",h-tmp);
44 }
45 return 0;
46 }