bzoj1635 最高的牛
来源:互联网 发布:iphone7plus在线软件 编辑:程序博客网 时间:2024/05/01 12:39
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
HINT
Source
Silver
题解
这道题开始没往运算符重载上打const,CE了三次,心累
像这种区间小于什么的题,一般可以往差分序列上想
每读到一组a,b,就令sum[a+1]--,sum[b]++,然后初始高度为h,就可以搞出来了
具体见代码
#include <cstdio>#include <iostream>#include <algorithm>using namespace std;const int maxn=100007;struct point{ int a,b; point(int a=0,int b=0):a(a),b(b){ } bool operator < (point a1) const{ return a!=a1.a?a<a1.a:b<a1.b; }}e[maxn];int sum[maxn];int main(){ int n,q,h,r; scanf("%d%d%d%d",&n,&q,&h,&r); for(int i=1;i<=r;i++){ scanf("%d%d",&e[i].a,&e[i].b); if(e[i].a>e[i].b) swap(e[i].a,e[i].b); } sort(e+1,e+r+1); for(int i=1;i<=r;i++) { if(e[i].a==e[i-1].a&&e[i].b==e[i-1].b) continue; sum[e[i].a+1]--; sum[e[i].b]++; } for(int i=1;i<=n;i++){ sum[i]+=sum[i-1]; printf("%d\n",h+sum[i]); } return 0;}
- bzoj1635 最高的牛
- [bzoj1635]最高的牛
- bzoj1635: [Usaco2007Jan]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 最高的牛
- BZOJ1635 [Usaco2007 Jan]Tallest Cow 最高的牛 数列差分
- bzoj1635
- 人气最高的网络游戏
- 最高的奖励
- N!的最高位
- 最高波特率的瓶颈
- 最高的分数
- 最高的奖励 【贪心】
- 阶乘的最高位
- 观察者模式
- 在lua中常用到的几个小函数
- Python自学之collection
- 帧速度的控制
- flash外部引入视频
- bzoj1635 最高的牛
- Yii的增删改查-分页
- D类功放设计
- C#CAD二次开发图案填充对象边界提取
- laraver的增删改查-分页
- 计算缓存大小并且清空缓存
- linux关于bashrc与profile的区别(转)
- JS实用ToolKit--NO1.数组排序
- http协议