POJ 3250 Bad Hair Day

原创 2015年11月18日 17:05:18
Bad Hair Day
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 15977   Accepted: 5400

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 ≤ h≤ 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

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

//思路转换成求每个牛被看到的次数之和,于是可以用一个单调栈来维护,依次读入数据,删除栈中所有小于当前牛高度的牛,剩下的就是可以看到当前牛发型的牛了,再把当前牛存进栈里
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <cctype>
#include <vector>
#include <cmath>
using namespace std;

int main()
{
    int n, m;
    int s[80005];

    while(~ scanf("%d", &n))
    {
        int top = 0;
        long long res = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%d", &m);
            while(top > 0 && s[top-1] <= m) top--;
            res += top;
            s[top++] = m;
        }
        printf("%lld\n", res);
    }

	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

Bad Hair Day POJ - 3250

题目链接:点我 Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow i...

POJ 3250 Bad Hair Day

顺手写个单调队列。。。。 Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536KB   64b...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

POJ 3250 Bad Hair Day

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15977   ...

poj 3250 Bad Hair Day

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15968   ...

POJ 3250 Bad Hair Day(单调)

Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each cow is self-cons...

Pku-3250 Bad Hair Day

3250 - Bad Hair Day 时间限制: 2000MS 内存限制: 65536K 问题描述 Some of Farmer John's N...

POJ 3250 Bad Hair Day(单调栈)

题目: Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 1...

POJ 3250 Bad Hair Day 【单调栈】

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15952   ...

Bad Hair Day(POJ 3250) 单调栈

来自《挑战程序设计竞赛》 单调栈的应用 单调栈,顾名思义,栈中的元素是单调递增或者单调递减的。 1.题目原文 http://poj.org/problem?id=3250 Bad Hair Da...

POj 3250 Bad Hair Day (思维+单调栈)

Bad Hair Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19167 Accepted: 6522 De...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)