Poj 3250 Bad Hair Day 【单调栈】
来源:互联网 发布:数控加工中心软件 编辑:程序博客网 时间:2024/06/06 05:55
题目链接:Poj 3250 Bad Hair Day
Bad Hair Day
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 16700 Accepted: 5621
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, cow i 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 cow i.
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 cow i; please compute the sum of c1 through cN.For this example, the desired is answer 3 + 0 + 1 + 0 + 1 + 0 = 5.
Input
Line 1: The number of cows, N.
Lines 2..N+1: Line i+1 contains a single integer that is the height of cow i.
Output
Line 1: A single integer that is the sum of c1 through cN.
Sample Input
6
10
3
7
4
12
2
Sample Output
5
题意:给定n头牛的高度,设d(i)为第i头牛可以看到(向右看)的其它牛的总数。求
思路:反过来想,求第i头牛可以被左边多少头牛看到。维护一个单调栈即可。
AC代码:
#include <iostream>#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#define CLR(a, b) memset(a, (b), sizeof(a))using namespace std;typedef long long LL;const int MAXN = 1e4 +10;const int INF = 0x3f3f3f3f;int Stack[80000+1];int main(){ int N; while(scanf("%d", &N) != EOF) { LL ans = 0; int top = 0; for(int i = 1; i <= N; i++) { int a; scanf("%d", &a); while(top && Stack[top-1] <= a) { top--; } ans += top; Stack[top++] = a; } printf("%lld\n", ans); } 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【单调栈】
- DOS的一些方法和原理
- linux常用基础命令
- linux学习笔记入门之环境变量和文件查找
- Logistic regression
- 使用runcat.sh命令生成BIEE 11g catalog元数据
- Poj 3250 Bad Hair Day 【单调栈】
- jvm 参数
- nyoj643
- 一、友录项目框架搭建
- 常用原生JS方法总结(兼容性写法)
- XMG s事件的传递顺序
- leetcode 283---Move Zeroes&&对vector erase()和remove用法的感悟
- 数据结构初学过程中对算法效率度量的理解
- [项目管理]关于风险管理的问题和可能过早的幼儿教育