文章标题 HDU 3410 ： Passing the Message （单调栈）

Passing the Message

What a sunny day! Let’s go picnic and have barbecue! Today, all kids in “Sun Flower” kindergarten are prepared to have an excursion. Before kicking off, teacher Liu tells them to stand in a row. Teacher Liu has an important message to announce, but she doesn’t want to tell them directly. She just wants the message to spread among the kids by one telling another. As you know, kids may not retell the message exactly the same as what they was told, so teacher Liu wants to see how many versions of message will come out at last. With the result, she can evaluate the communication skills of those kids.
Because all kids have different height, Teacher Liu set some message passing rules as below:

1.She tells the message to the tallest kid.

2.Every kid who gets the message must retell the message to his “left messenger” and “right messenger”.

3.A kid’s “left messenger” is the kid’s tallest “left follower”.

4.A kid’s “left follower” is another kid who is on his left, shorter than him, and can be seen by him. Of course, a kid may have more than one “left follower”.

5.When a kid looks left, he can only see as far as the nearest kid who is taller than him.

The definition of “right messenger” is similar to the definition of “left messenger” except all words “left” should be replaced by words “right”.

For example, suppose the height of all kids in the row is 4, 1, 6, 3, 5, 2 (in left to right order). In this situation , teacher Liu tells the message to the 3rd kid, then the 3rd kid passes the message to the 1st kid who is his “left messenger” and the 5th kid who is his “right messenger”, and then the 1st kid tells the 2nd kid as well as the 5th kid tells the 4th kid and the 6th kid.
Your task is just to figure out the message passing route.
Input
The first line contains an integer T indicating the number of test cases, and then T test cases follows.
Each test case consists of two lines. The first line is an integer N (0< N <= 50000) which represents the number of kids. The second line lists the height of all kids, in left to right order. It is guaranteed that every kid’s height is unique and less than 2^31 – 1 .
Output
For each test case, print “Case t:” at first ( t is the case No. starting from 1 ). Then print N lines. The ith line contains two integers which indicate the position of the ith (i starts form 1 ) kid’s “left messenger” and “right messenger”. If a kid has no “left messenger” or “right messenger”, print ‘0’ instead. (The position of the leftmost kid is 1, and the position of the rightmost kid is N)
Sample Input
2
5
5 2 4 3 1
5
2 1 4 3 5
Sample Output
Case 1:
0 3
0 0
2 4
0 5
0 0
Case 2:
0 2
0 0
1 4
0 0
3 0

题意：简单说就是有n个数的序列，然后对于第i个数a[i],在左边求出比他小的数中最大的数的位置，右边找一个比他小的数的中最大的那个数的位置，如果不存在就输出0.
分析：用单调栈，用单调下降栈来维护，左有两边扫一遍，一边维护一边更新。
代码：

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<math.h>
#include<stack>
#include<map>
#include<queue> 
#include<algorithm>
using namespace std;
const int inf = 0x3f3f3f3f;
typedef pair<int,int> pii;

int a[50005];
int dpl[50005],dpr[50005]; 
int n;
stack<int>st;

int main ()
{
    int T;
    scanf ("%d",&T);
    int cnt=1;
    while (T--){
        scanf ("%d",&n);
        for (int i=1;i<=n;i++){
            scanf ("%d",&a[i]);
            dpl[i]=dpr[i]=0;
        }
        while (!st.empty())st.pop();
        for (int i=1;i<=n;i++){//从左往右 
            while (!st.empty()&&a[st.top()]<=a[i]){
                int tmp=st.top();st.pop();
                if (!st.empty())dpr[st.top()]=tmp;//更新 
            }
            st.push(i);
        }
        while (!st.empty()){
            int tmp=st.top();st.pop();
            if (!st.empty())dpr[st.top()]=tmp;//清空栈的过程中，继续更新 
        }
        for (int i=n;i>=1;i--){//同上 ，从右往左 
            while (!st.empty()&&a[st.top()]<=a[i]){
                int tmp=st.top();st.pop();
                if (!st.empty())dpl[st.top()]=tmp;
            }
            st.push(i);
        }
        while (!st.empty()){
            while (!st.empty()){
                int tmp=st.top();st.pop();
                if (!st.empty())dpl[st.top()]=tmp;
            }
        }
        printf ("Case %d:\n",cnt++);
        for (int i=1;i<=n;i++){
            printf ("%d %d\n",dpl[i],dpr[i]);
        }
    }

    return 0;
}