Bad Hair Day

Bad Hair Day

Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other)

Total Submission(s) : 87   Accepted Submission(s) : 35

Problem 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 h_i (1 ≤ h_i ≤ 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 c_i denote the number of cows whose hairstyle is visible from cow i; please compute the sum of c₁ through c_N.For this example, the desired is answer 3 + 0 + 1 + 0 + 1 + 0 = 5.

 

Input

Line 1: The number of cows, <i>N</i>. <br>Lines 2..N+1: Line <i>i</i>+1 contains a single integer that is the height of cow <i>i</i>.

 

Output

Line 1: A single integer that is the sum of <i>c</i>₁ through <i>c_N</i>.

 

Sample Input

  
  

   
   6
10
3
7
4
12
2
  
  

 

Sample Output

  
  

   
   5
  
  
  
  

   
   题意：向右找比当前位置小的数 碰到大的就下一个位置
  
  
  
  

   
   思路：
  
  
  
  

   
   队列
  
  
  
  

   
   第一个元素入队  如果第二个元素比第一个小 入队 否则替代当前位置
  
  
  
  

   
   如此下去   因为每个新入队的元素必定比队列前面的元素小 所以每次入队后sum加上num值 以为前面的元素也要加上
  
  
  
  

   
   很巧妙 大佬的思想  
  
  
  
  

   
   #include<iostream>
#include<stdio.h>
#include<queue>
using namespace std;
int main()
{
    queue<long long>q;
    int n,i,j;
    long long a[80001];
    long long temp;
    long long x;
    while(cin>>n)
    {
        //while(!q.empty())q.pop();
        long long sum=0;
        int num=0;
        for(i=1;i<=n;i++)
        {
            scanf("%lld",&x);
            while(num>0&&a[num]<=x)
                num--;
            sum+=num;
            num++;
            a[num]=x;
            }
       /* int num=0;
        int next=1;
        while(num<n-1)
        {
            if(a[num]>a[next]&&next<n)
            {
                sum++;
                next++;
                }
            else
            }*/
        cout<<sum<<endl;
        }
    return 0;
    }