POJ 3250 Bad Hair Day 【单调栈】
来源:互联网 发布:有所不行 知和而和 编辑:程序博客网 时间:2024/06/08 11:49
Description
Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-conscious about her messy hairstyle, FJ wants to count the number of other cows that can see the top of other cows' heads.
Each cow i has a specified height hi (1 ≤hi ≤ 1,000,000,000) and is standing in a line of cows all facing east (to the right in our diagrams). Therefore, cowi can see the tops of the heads of cows in front of her (namely cows i+1, i+2, and so on), for as long as these cows are strictly shorter than cowi.
Consider this example:
== == - = Cows facing right -->= = == - = = == = = = = =1 2 3 4 5 6
Cow#1 can see the hairstyle of cows #2, 3, 4
Cow#2 can see no cow's hairstyle
Cow#3 can see the hairstyle of cow #4
Cow#4 can see no cow's hairstyle
Cow#5 can see the hairstyle of cow 6
Cow#6 can see no cows at all!
Let ci denote the number of cows whose hairstyle is visible from cowi; please compute the sum of c1 throughcN.For this example, the desired is answer 3 + 0 + 1 + 0 + 1 + 0 = 5.
Input
Lines 2..N+1: Line i+1 contains a single integer that is the height of cowi.
Output
Sample Input
610374122
Sample Output
5
恩,题目大意就是说,一头牛 i 只能看到它右边比它矮的牛 j ,但是若在 i 和 j 直间存在比 i 低而比 j 高的牛 k ,则 i 看不到 j 了。总的求的是所有牛能看到的它右边的牛的总和。也就是说,所有牛能被除它之外的牛看到的次数,直接求超时,看人家题解,是单调栈。而单调栈,即是单调增或减的,在当前元素入栈前将栈中比它小(大)或相等的元素删除,如此得到了单调栈。。。。
#include <iostream>#include<cstdio>#include<cstring>#include<stack>#define maxn 80000using namespace std;int rec[maxn];int main(){ int n; unsigned long sum; while(~scanf("%d",&n)) { sum=0; stack<int>s; int tem; scanf("%d",&tem); s.push(tem); for(int i=1;i<n;++i) { scanf("%d",&tem); while(!s.empty()&&s.top()<=tem) s.pop(); sum+=s.size(); s.push(tem); } printf("%u\n",sum); } return 0;}
- poj 3250:Bad Hair Day---单调栈
- POJ 3250 Bad Hair Day(单调栈)
- POJ 3250 Bad Hair Day(单调栈)
- POJ 3250 Bad Hair Day 单调栈
- poj 3250 Bad Hair Day 单调栈
- [单调栈] poj 3250 Bad Hair Day
- POJ 3250 Bad Hair Day 【单调栈】
- poj 3250 Bad Hair Day 【单调栈】
- poj 3250 Bad Hair Day(单调栈)
- Poj 3250 Bad Hair Day 【单调栈】
- POJ 3250 - Bad hair day(单调栈)
- poj-3250 Bad Hair Day(单调栈)
- Bad Hair Day(POJ 3250) 单调栈
- poj 3250 Bad Hair Day单调栈
- Bad Hair Day -- 3250poj 单调栈
- POJ 3250 Bad Hair Day (单调栈)
- poj 3250 Bad Hair Day(单调栈)
- POJ 3250 Bad Hair Day【单调栈】
- MySQL_MyISAM和InnoDB存储引擎的比较
- 无线网络基础
- IOS Toast
- ios的手势操作之UIGestureRecognizer浅析
- 关于eclipse连接数据库的问题
- POJ 3250 Bad Hair Day 【单调栈】
- C语言复杂类型声明
- spring-boot实现web项目的运行
- 移动测试人员的未来:测试开发技术的融合
- 嵌入式系统支持ramdisk文件系统
- 十进制中正整数N中1的个数(2)
- HDU 1849 Rabbit and Grass(博弈入门)
- UI之事件与手势详解
- golang postgresql数据库驱动