Bad Hair Day （单调栈）

最新推荐文章于 2021-05-02 09:50:44 发布

sdau20163940

最新推荐文章于 2021-05-02 09:50:44 发布

阅读量456

点赞数 1

分类专栏：单调队列

本文链接：https://blog.csdn.net/sinat_37668729/article/details/77155580

版权

单调队列专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Bad Hair Day

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

Total Submission(s) : 50 Accepted Submission(s) : 18

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, 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 c_i denote the number of cows whose hairstyle is visible from cowi; 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, 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

Sample Output

Source

PKU

题意：

大体意思就是一串数字，以每一个数为起点，向后找比他小的，问总共有多少。‘

思路：

利用栈的后进的先出的特点进行操作，碰见比它大的就出栈，每次只需加上栈里元素的数量即可。

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#include <map>
#include <stack>
#include <vector>
#include <set>
#include <stdio.h>
#include <queue>
#include <iomanip>
#define maxn 100000
#define mod 1000000007
#define INF 0x3f3f3f3f
#define exp 1e-6
#define pi acos(-1.0)
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    int n,i;
    long long a[maxn],sum=0;
    stack<long long>q;
    cin>>n;
   // int head=1,tail=0;
    for(i=0;i<n;i++)cin>>a[i];
    for(i=0;i<n;i++)
    {
        while(!q.empty()&&q.top()<=a[i])q.pop(); //关键点
        sum+=q.size();   //加上栈里元素的个数
        q.push(a[i]);
    }
    cout<<sum<<endl;
    return 0;
}

单调队列（思路一样）：

#include <iostream>
#include <cstdio>
#include <cstring>
#define MAXN 80050
#define LL long long
using namespace std;
LL q[MAXN];
int main()
{
    int n;
    scanf("%d",&n);
    LL a;
    LL ans=0;
    int rear=-1,front=0;
    for(int i=0;i<n;i++){
        scanf("%I64d",&a);
        while(rear>=front&&q[rear]<=a)rear--;
        q[++rear]=a;
        ans+=rear;
    }
    cout<<ans<<endl;
    return 0;
}