USACO 2009 Mar Silver 3.Look Up
来源:互联网 发布:淘宝买家秀模板 编辑:程序博客网 时间:2024/05/17 06:25
Description
Farmer John's N (1 <= N <= 100,000) cows, conveniently numbered
1..N, are once again standing in a row. Cow i has height H_i (1 <=
H_i <= 1,000,000).
Each cow is looking to her left toward those with higher index
numbers. We say that cow i 'looks up' to cow j if i < j and H_i <
H_j. For each cow i, FJ would like to know the index of the first
cow in line looked up to by cow i.
Note: about 50% of the test data will have N <= 1,000.
Input
* Line 1: A single integer: N
* Lines 2..N+1: Line i+1 contains the single integer: H_i
Output
* Lines 1..N: Line i contains a single integer representing the
smallest index of a cow up to which cow i looks. If no such
cow exists, print 0.
Sample Input
Sample Output
HINT
INPUT DETAILS:
FJ has six cows of heights 3, 2, 6, 1, 1, and 2.
OUTPUT DETAILS:
Cows 1 and 2 both look up to cow 3; cows 4 and 5 both look up to cow 6; and
cows 3 and 6 do not look up to any cow.
可以用单调栈维护
有高的点直接比较大小之后赋值编号
#include<stdio.h>int a[100001],s[100001],ans[100001],i,top;int main(){int n;scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d",&a[i]);for(i=n;i>=0;i--){while(top&&a[s[top]]<=a[i])top--;ans[i]=s[top];s[++top]=i;}for(i=1;i<=n;i++)printf("%d\n",ans[i]);}
- USACO 2009 Mar Silver 3.Look Up
- USACO 2009 Mar Look Up 向右看齐
- [USACO 2014 Mar Silver]irrigation
- [USACO 2014 Mar Silver]mooomoo
- USACO 2010 Mar Silver 3.Need For Speed 贪心
- [USACO 2014 Mar Silver]Fair Photography
- bzoj3401[Usaco2009 Mar]Look Up 仰望
- [BZOJ3401] [Usaco2009 Mar]Look Up 仰望
- BZOJ 3401: [Usaco2009 Mar]Look Up 仰望
- bzoj 3401: [Usaco2009 Mar]Look Up 仰望
- bzoj3401 [Usaco2009 Mar]Look Up 仰望
- [bzoj3401][Usaco2009 Mar]Look Up 仰望
- BZOJ1584 USACO 2009 Mar Gold 2.Cleaning Up
- 【BZOJ3401】[Usaco2009 Mar]Look Up 仰望【单调栈】
- [BZOJ3401][Usaco2009 Mar]Look Up 仰望(单调栈)
- bzoj3401 [Usaco2009 Mar]Look Up 仰望 单调栈
- 【BZOJ3401】【单调栈】[Usaco2009 Mar]Look Up 仰望 题解
- USACO 2009 Mar CleaningUp
- Lintcode 74 First Bad Version solution 题解
- 【修改】wordpress 文章末尾加上相关文章--亲测可用
- Python3 网络爬虫入门知识碎片
- C语言基础:用快速排序实现输出最大数
- 泛型
- USACO 2009 Mar Silver 3.Look Up
- 什么是SOAP
- C语言实验——分数序列
- 写技术类书小技巧
- 设计原则之单一职责原则
- css3设置阴影
- HDU
- 适应度函数及遗传操作
- SSH简介