POJ 3250 Bad Hair Day 模拟单调栈

原创 2015年07月06日 19:47:18

Bad Hair Day
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 14989   Accepted: 4977

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 <stdio.h>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#define N 100009
typedef long long ll;

using namespace std;

ll a[N];

int main()
{
    int n;
    while(~scanf("%d",&n))
    {
        for(int i=1;i<=n;i++)
            scanf("%I64d",&a[i]);

        ll ans=0;
        int b[N];
        b[n]=n;
        for(int i =n-1;i>=1;i--)
        {
            int tt=i;
            while(tt<n&&a[i]>a[tt+1]) tt=b[tt+1];//严格单调,不去等号
            b[i]=tt;
        }

//        for(int i=1;i<=n;i++)
//        cout<<b[i]<<" ";

        for(int i=1;i<=n;i++)
        {
            ans+=b[i]-i;
        }
        printf("%I64d\n",ans);

    }

    return 0;
}






相关文章推荐

poj3250Bad Hair Day【单调栈】

Language: Default Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 1...

POJ3250---Bad Hair Day(单调栈)

DescriptionSome 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: 65536K Total Submissions: 15952   ...
  • wyjwyl
  • wyjwyl
  • 2015年11月15日 18:22
  • 300

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

POJ地址:http://poj.org/problem?id=3250 Bad Hair Day Description Some of Farmer John's N cows (...

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

Bad Hair Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19167 Accepted: 6522 De...
  • nka_kun
  • nka_kun
  • 2017年07月18日 12:50
  • 126

POJ3250 Bad Hair Day 单调栈

Bad Hair Day Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each co...

Bad Hair Day(问题抽象转化+“贡献值”思想+单调栈)

Link:http://poj.org/problem?id=3250 Bad Hair Day Time Limit: 2000MS   Me...

POJ3250——Bad Hair Day(栈的应用)

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

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

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...
  • cccruel
  • cccruel
  • 2017年07月22日 09:45
  • 54
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:POJ 3250 Bad Hair Day 模拟单调栈
举报原因:
原因补充:

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