P2879 [USACO07JAN]Tallest Cow S
题目描述
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.
输入格式
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.
题意翻译
题目描述:
FarmerJohn 有n头牛,它们按顺序排成一列。 FarmerJohn 只知道其中最高的奶牛的序号及它的高度,其他奶牛的高度都是未知的。现在 FarmerJohn 手上有RR条信息,每条信息上有两头奶牛的序号(aa和bb),其中bb奶牛的高度一定大于等于aa奶牛的高度,且aa,bb之间的所有奶牛的高度都比aa小。现在FarmerJohnFarmerJohn想让你根据这些信息求出每一头奶牛的可能的最大的高度。(数据保证有解)
输入格式:
第1行:四个以空格分隔的整数:nn,ii,hh和RR(nn和RR意义见题面; ii 和 hh 表示第 ii 头牛的高度为 hh ,他是最高的奶牛)
接下来R行:两个不同的整数aa和bb(1 ≤ aa,bb ≤ n)
输出格式:
一共n行,表示每头奶牛的最大可能高度.
数据范围:
1 ≤ n ≤ 10000 ; 1 ≤ h ≤ 1000000 ; 0 ≤ R ≤ 10000)
Translate provided by @酥皮
输入输出样例
输入 #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
前缀和思想
初始每头牛都最高,随着限制条件输入:最佳情况是这些牛之间的牛高度都减一,直接用差分,牛的高度就是前缀和数组。只不过我们只知道最高的牛,所以要从最高的牛向两边撸。
还要注意数据重复(坑货
n,w,h,r = map(int,input().split())
a = [0]*(n+1)
ans = [h]*(n+1)
d = []
for i in range(r):
x,y = map(int,input().split())
if not([x,y] in d or [y,x] in d):
d.append([x,y])
d.append([y,x])
if abs(x-y)>1:
if x>y:
x,y = y,x
a[x]-=1
a[y-1]+=1
for i in range(w+1,n):
ans[i]=ans[i-1]+a[i-1]
for i in range(w-1,0,-1):
ans[i]=ans[i+1]-a[i]
for i in range(1,n+1):
print(ans[i])
#print(*a)
推荐阅读
-
P2879 [USACO07JAN]区间统计Tallest Cow
-
[洛谷]P2879 [USACO07JAN]区间统计Tallest Cow (#模拟)
-
差分+思维 [USACO07JAN]Tallest Cow S(洛谷 P2879)
-
差分数组-P2879 [USACO07JAN]区间统计Tallest Cow
-
[USACO07JAN]区间统计Tallest Cow
-
题解 P2879 【[USACO07JAN]区间统计Tallest Cow】
-
P2879 [USACO07JAN]Tallest Cow S
-
洛谷 P2879 [USACO07JAN]区间统计Tallest Cow
-
P2879 [USACO07JAN]Tallest Cow S
-
P2879 [USACO07JAN]Tallest Cow S