bzoj 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
来源:互联网 发布:奎托斯希腊神话知乎 编辑:程序博客网 时间:2024/05/16 11:28
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)头牛从1到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
1 3
5 3
4 3
3 7
9 8
INPUT DETAILS:
There are 9 cows, and the 3rd is the tallest with height 5.
Sample Output
4
5
3
4
4
5
5
5
#include<cstdio>#include<algorithm>using namespace std;struct cow{ int x,y;}a[100001];int f[100001];inline bool cmp(cow x,cow y){ if(x.x<y.x) return true; if(x.x==y.x&&x.y<y.y) return true; return false;}int main(){ int n,i,h,r; scanf("%d%d%d%d",&n,&i,&h,&r); int ii; int x,y; for(ii=1;ii<=r;ii++) { scanf("%d%d",&x,&y); if(x>y) { int t=x; x=y; y=t; } a[ii].x=x; a[ii].y=y; } sort(a+1,a+1+r,cmp); for(ii=1;ii<=r;ii++) { if(a[ii].x==a[ii-1].x&&a[ii].y==a[ii-1].y) continue; f[a[ii].x+1]--; f[a[ii].y]++; } int sum=0; for(i=1;i<=n;i++) { sum+=f[i]; printf("%d\n",sum+h); } return 0;}
- BZOJ 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- bzoj 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- 【bzoj 1635】: [Usaco2007 Jan]Tallest Cow 最高的牛
- BZOJ 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- bzoj 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- |BZOJ 1635|差分序列|[Usaco2007 Jan]Tallest Cow 最高的牛
- bzoj1635 [Usaco2007 Jan]Tallest Cow 最高的牛
- bzoj1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- BZOJ1635 [Usaco2007 Jan]Tallest Cow 最高的牛
- BZOJ1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- BZOJ1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- bzoj1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- 1635: [Usaco2007 Jan]Tallest Cow 最高的牛 ——by lethalboy
- BZOJ1635 [Usaco2007 Jan]Tallest Cow 最高的牛 数列差分
- bzoj1635: [Usaco2007Jan]Tallest Cow 最高的牛
- BZOJ 1633: [Usaco2007 Feb]The Cow Lexicon 牛的词典
- VMware 10安装CentOs 6.5
- socket: Socket原理与编程基础
- 视频跟踪论文读后感系列一:Adaptive Color Attributes for Real-Time Visual Tracking(CVPR2014)
- Oracle Client安装失败,提示未能满足某些最低安装要求
- XMPP
- bzoj 1635: [Usaco2007 Jan]Tallest Cow 最高的牛
- MFC GDI坐标映射实例详解
- java实现二叉树的构建以及3种遍历方法
- C++的一些基础知识,对面试大有裨益
- JavaScript事件在WebKit中的处理流程研究
- 设计模式之结构型模式(7种)
- 抹墙钢板网的应用及产品简介
- poj 3352--Road Construction(双连通分量)
- matrix.set,pre,post用法