POJ3250 牛的视野（单调栈）

最新推荐文章于 2021-05-28 19:18:51 发布

_wjunjie

最新推荐文章于 2021-05-28 19:18:51 发布

阅读量450

点赞数 1

分类专栏：数据结构

本文链接：https://blog.csdn.net/qq_41661919/article/details/89981701

版权

数据结构专栏收录该内容

65 篇文章 0 订阅

订阅专栏

~by Wjvje，2019-5-8

题目描述：

Bad Hair Day

Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 24620 Accepted: 8363

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 ican 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

核心题意：

一群高度不完全相同的牛从左到右站成一排，每头牛只能看见它右边的比它矮的牛的发型，

若遇到一头高度大于或等于它的牛，则无法继续看到这头牛后面的其他牛，给出这些牛的高度，

要求每头牛可以看到的牛的数量的和。

代码实现：

#define io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
const int N=1e5+100;
int s[N],a[N]; 
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        memset(s,0,sizeof(s));
        memset(a,0,sizeof(a));
        for(int i=1;i<=n;++i)scanf("%d",&a[i]);
        int p=0;
        LL ans=0;
        s[p]=INF;
        for(int i=1;i<=n;++i)
        {
            if(s[p]>a[i])s[++p]=a[i];
            else
            {
                while(s[p]<=a[i])p--;
                s[++p]=a[i];
            }
            ans+=p-1;
        }
        printf("%lld\n",ans);
    }
    return 0;
}

The end；