Look Up

Problem 1845 Look Up

Accept: 173    Submit: 543
Time Limit: 1000 mSec    Memory Limit : 32768 KB

 Problem Description

N (1 <= N <= 100,000) monkeys in the mountains, conveniently numbered 1..N, are once again standing in a row. Monkey i has height H_i (1 <= H_i <= 1,000,000).

Each monkey is looking to his left toward those with higher index numbers. We say that monkey i "looks up" to monkey j if i < j and H_i < H_j. For each monkey i, we would like to know the index of the first monkey in line looked up to by monkey i.

 Input

Input consists of several testcases. The format of each case as follow:

• Line 1: A single integer: N
• Lines 2..N+1: Line i+1 contains the single integer: H_i

 Output

For each testcase, output N lines. Line i contains a single integer representing the smallest index of a monkey up to which monkey i looks. If no such monkey exists, print 0.

 Sample Input

6 3 2 6 1 1 2

 Sample Output

3 3 0 6 6 0

 Hint

Monkey 1 and 2 both look up to monkey 3; monkey 4 and 5 both look up to monkey 6; and monkey 3 and 6 do not look up to any monkey.

 Source

Funny Programming Contest -- OSUM

Submit  Back  Status

 

用优先队列保存输入信息。

#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;

struct Height
{
    int h, id;
}hei[100005];
int ans[100005], n;
priority_queue<Height> Q;

bool operator < (const Height& x, const Height& y)
{
    return x.h > y.h;
}

int main()
{
    while(scanf("%d", &n) != EOF)
    {
        for(int i = 0; i < n; i++)
        {
            scanf("%d", &hei[i].h);
            hei[i].id = i;
            while(!Q.empty() && hei[i].h > (Q.top()).h)
            {
                ans[(Q.top()).id] = i + 1;
                Q.pop();
            }
            Q.push(hei[i]);
        }
        while(!Q.empty())
        {
            ans[(Q.top()).id] = 0;
            Q.pop();
        }
        for(int i = 0; i < n; i++) printf("%d\n", ans[i]);
    }
    return 0;
}