C语言实验--Bad Hair Day

来源:百度知道 编辑:UC知道 时间:2024/09/14 23:15:10
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!

#include<cstdio>#include<stack> using namespace std; int main() { stack<int> s; __int64 sum; int n,h,t; while(~scanf("%d",&n)) { sum=0; scanf("%d",&h); s.push(h); for(int i=1;i<n;++i) { scanf("%d",&t); while(!s.empty()&&t>=s.top()) s.pop(); sum+=s.size(); s.push(t); } printf("%lld\n",sum); while(!s.empty()) s.pop(); } return 0; }