# 猴子向右看，FOJ上某题 单调栈

N (1 <= N <= 100,000) monkeys in the mountains, conveniently numbered 1..N, are once again standing in a row. Monkey i has height Hi (1 <= Hi <= 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 Hi< Hj. 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: NLines 2..N+1: Line i+1 contains the single integer: Hi

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

6326112

Sample Output

330660

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.

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#include <stack>
#define N 100009
using namespace std;

int a[N];

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

int ans[N];
memset(ans,0,sizeof ans);
ans[n]=n;//初始化为n，但是实际值为0
for(int i=n-1;i>=1;i--)//找右边第一个比a[i]小的位置
{
int tt=i;
while(tt<n&&a[i]>=a[tt+1]) tt=ans[tt+1];
ans[i]=tt;
}

for(int i=1;i<n;i++)
{
if(ans[i]==n)//当是最后一个猴子的时候，并不一定保证比当前猴子高
if(a[i]<a[n])
printf("%d\n",ans[i]+1);
else
cout<<0<<endl;
else
printf("%d\n",ans[i]+1);

}

cout<<0<<endl;

}
return 0;
}


#### 单调栈练习题题解

2015-07-30 20:14:39

#### PAT-猴子选大王(基础编程题）

2015-12-28 23:26:16

#### 单调栈原理及应用 详解 附各种类型的题目练习

2017-09-29 15:25:12

#### 单调队列、单调栈（第一周DIY）

2012-03-07 00:45:03

#### 一个比较有意思的算法题，猴子选大王

2015-10-21 18:00:27

#### 猴子吃香蕉 智力题

2013-03-01 11:21:56

#### 单调栈问题系列

2017-08-24 14:32:07

#### java编程题：猴子吃桃

2017-11-15 15:03:30

#### 左神面试算法整理---单调栈

2017-07-25 17:15:34

#### POJ 2796：Feel Good 单调栈经典题

2015-10-15 09:52:47