Passing the Message
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 872 Accepted Submission(s): 571
Problem Description
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.
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 .
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
Source
Recommend
wxl
题意:一个小孩能看到左边比它矮,但是最高的小孩,右边也是一样,这意味这我们要做两个单调站,两个都是单调递增栈,(从栈顶到栈底依次递增),假如它比栈顶元素小,这证明它没法看到比它矮的,直接入栈,输出-1,但元素大于栈顶元素时,从栈顶元素开始出栈,直到找到比这一个元素还要大位置,即这个元素能够看到最远的左边边界(比它高),那么在这些出栈元素中找到最大值,那么就是这个元素能看到左边的值;同理找右边也是一样做了单调递增栈,然后是从最后一个元素开始遍历(如果从第一个元素开始遍历,找不到它右边的元素,因此要从最后一个元素开始遍历)
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <stack>
using namespace std;
long long a[50009];
long long l[50009];
long long r[50009];
int Count=1;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,j,k,n,M;
stack<int >s;
while(!s.empty())
{
s.pop();
}
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%lld",&a[i]);
}
a[n+1]=-1;//先维护一个单调递增栈,即先做看左边的栈
//与之前的题目不同
//这道题当a[i]>栈前面的元素,那么这些元素都需要出栈
//因为后面的元素只会看最高的,前面小于a[i]的元素没有必要存在
//找不到小于a[i]的元素,即0
//最后再将a[i]入栈
for(i=1; i<=n; i++)
{
M=-1;
while(!s.empty()&&a[s.top()]<a[i])
{
if(a[s.top()]>M)
{
M=a[s.top()];
k=s.top();//记录下标
}
s.pop();
}
if(M==-1) l[i]=0;//没找到一个小于它的元素
else l[i]=k;//找到小于它的元素,将它下标记录
s.push(i);
}
while(!s.empty()) s.pop();
for(i=n; i>=1; i--)
{
M=-1;
while(!s.empty()&&a[s.top()]<a[i])//找右边
{
if(a[s.top()]>M)
{
M=a[s.top()];
k=s.top();
}
s.pop();
}
if(M==-1) r[i]=0;
else r[i]=k;
s.push(i);
}
printf("Case %d:\n",Count++);
for(i=1; i<=n; i++)
{
printf("%lld %lld\n",l[i],r[i]);
}
}
}