关闭

poj--3250--Bad Hair Day(模拟)

171人阅读 评论(0) 收藏 举报
分类:
Time Limit: 2000MS   Memory Limit: 65536KB   64bit IO Format: %I64d & %I64u

Status

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

Source

Status


#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int num[101000];
int main()
{
    int n;
    while(scanf("%d",&n)!= EOF)
    {
        int top = 0;
        long long ans = 0;
        for(int i = 0; i < n; i++)
        {
            int h; 
			scanf("%d",&h);
			//保证严格单调递减的序列 
            while(top > 0 && num[top] <= h)
                --top;
            ans += top;//记录每一个下标和 
            num[++top] = h;
        }
        printf("%lld\n",ans);
    }
    return 0;
}


0
0
查看评论

Bad Hair Day(POJ 3250) 单调栈

来自《挑战程序设计竞赛》 单调栈的应用 单调栈,顾名思义,栈中的元素是单调递增或者单调递减的。 1.题目原文 http://poj.org/problem?id=3250 Bad Hair Day Time Limit: 2000MS   Memory Limit:...
  • qq_33929112
  • qq_33929112
  • 2016-10-06 16:25
  • 231

POJ 3250 Bad Hair Day(单调递增栈)

题目地址:点击打开链接 题意:牛排队排好,每个牛只能看到比它高度严格低的牛,问所有的牛能看到的个数 思路:换个思路,求每个牛能被看到多少次,加起来,和题目要求的结果是一样的,单调递增栈:http://blog.csdn.net/alongela/article/details/8227707 ...
  • qq_25605637
  • qq_25605637
  • 2015-11-14 20:08
  • 351

POJ 3250 Bad Hair Day (栈)

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15939   Accepted: 5381 Description S...
  • helloiamclh
  • helloiamclh
  • 2015-11-14 22:10
  • 312

Bad Hair Day--(单调队列)

Bad Hair Day Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 48 ...
  • sdau20163942
  • sdau20163942
  • 2017-08-14 10:04
  • 90

【bzoj1660】【单调栈】Bad Hair Day 乱发节

Description Input * Line 1: 牛的数量 N。  * Lines 2..N+1: 第 i+1 是一个整数,表示第i头牛的高度。 Output * Line 1: 一个整数表示c[1] 至 c[N]的和。 Sample Inpu...
  • sunshinezff
  • sunshinezff
  • 2015-05-21 19:32
  • 780

ACM--单调栈--Bad Hair Day--POJ--3250--水

POJ地址:http://poj.org/problem?id=3250 Bad Hair Day Description Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having...
  • qq_26891045
  • qq_26891045
  • 2016-04-16 15:49
  • 685

[BZOJ1660] [Usaco2006 Nov]Bad Hair Day 乱发节

[Usaco2006 Nov]Bad Hair Day 乱发节DescriptionInput Line 1: 牛的数量 N。 Lines 2..N+1: 第 i+1 是一个整数,表示第i头牛的高度。 Output Line 1: 一个整数表示c[1] 至 c[N]的和。 Sample Input6...
  • slongle_amazing
  • slongle_amazing
  • 2015-08-12 14:40
  • 571

HDOJ 题目3250 Bad Hair Day(技巧)

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 13562   Accepted: 4576 ...
  • yu_ch_sh
  • yu_ch_sh
  • 2014-12-30 19:03
  • 688

POJ 3250 Bad Hair Day 模拟单调栈

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 14989   Accepted: 4977 ...
  • wust_ZJX
  • wust_ZJX
  • 2015-07-06 19:47
  • 485

POJ--3250 -- Bad Hair Day [栈模拟]

Bad Hair Day     Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 11633 Accepted: 3927   ...
  • u011513596
  • u011513596
  • 2013-08-14 14:13
  • 822
    个人资料
    • 访问:162599次
    • 积分:7648
    • 等级:
    • 排名:第3344名
    • 原创:628篇
    • 转载:7篇
    • 译文:0篇
    • 评论:23条
    最新评论