Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 13562 | Accepted: 4576 |
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
Lines 2..N+1: Line i+1 contains a single integer that is the height of cow i.
Output
Sample Input
6
10
3
7
4
12
2
Sample Output
5
题意: 求所有牛 向右看,能看到的其他牛的头顶 的总数之和
换个角度来看,其实就是来求能看到当前牛的总和
单调栈思路:
题意就是高的向右能够看到身高比他矮的cow的头,求每一个cow能看到的人头数的和。问题转化就是每个人的头能被看几次的和。
如果用暴力的解法,复杂度是O(N^2)。这里用到了单调栈的数据结构,可以在线性时间里解决这个问题。
具体实现就是维护一个栈,首先先读入一个cow的高度,如果栈顶的cow的高度小于等于读入的这个cow,那么就出
栈,直到栈顶的cow的高度大于它,或者栈为空。此时这个栈里的元素都能够看到读入的cow的头顶,即栈的大小就
是当前读入的这个cow被看到的次数。
重复操作,直到cow读完。其复杂度是O(N)。
就是建立一个单调递减的栈。
注意: cin ,cout 会出现超时,要用scanf , printf .#include <iostream> #include <stdio.h> #include <algorithm> #include <cstring> #include <stack> using namespace std; const int M = 8*1e4+100; int a[M]; int main() { int n; while(cin >> n){ for(int i = 0;i < n;i++) //cin >> a[i]; scanf("%d",&a[i]); long long sum = 0; stack<int>s; for(int i = 0;i < n;i++) { while(s.size()&&a[s.top()] <= a[i]) { s.pop(); } sum += s.size(); s.push(i); } //cout << sum << endl; printf("%lld\n",sum); } return 0; }