STPAR - Street Parade

For sure, the love mobiles will roll again on this summer's street parade. Each year, the organisers decide on a fixed order for the decorated trucks. Experience taught them to keep free a side street to be able to bring the trucks into order.

The side street is so narrow that no two cars can pass each other. Thus, the love mobile that enters the side street last must necessarily leave the side street first. Because the trucks and the ravers move up closely, a truck cannot drive back and re-enter the side street or the approach street.

You are given the order in which the love mobiles arrive. Write a program that decides if the love mobiles can be brought into the order that the organisers want them to be.


There are several test cases. The first line of each test case contains a single number n, the number of love mobiles. The second line contains the numbers 1 to n in an arbitrary order. All the numbers are separated by single spaces. These numbers indicate the order in which the trucks arrive in the approach street. No more than 1000 love mobiles participate in the street parade. Input ends with number 0.


For each test case your program has to output a line containing a single word "yes" if the love mobiles can be re-ordered with the help of the side street, and a single word "no" in the opposite case.


Sample input:
5 1 2 4 3 

Sample output:


The sample input reflects the following situation:

The five trucks can be re-ordered in the following way:

hide comments
kislaykishore: 2019-01-31 05:04:33

@sdfg04 you can instead consider that there are 1 to n+1 trucks in the input with the n+1 truck bearing a large number > 1000. Then your existing logic should take care of emptying the stack.

sdfg04: 2019-01-05 21:37:23

Do not forget to empty the stack , in case someone is not defining seperate functions for such problem.
Took me an hour to realize.

Last edit: 2019-01-05 21:38:02
redporrot: 2018-12-22 15:57:24

how to input data? thanks

abhi11091993: 2018-12-13 04:23:08

They didn't frame question right... It took me 3 hrs to come to an accepted answer.
FYI 0 is after all the inputs are given.
5 4 3 2 1
2 3 1

suyashsingh234: 2018-12-10 06:14:31

One array for input and stack for the side street

xxfalconxx: 2018-12-04 12:49:21

finally accepted!!
swarm: 2018-06-25 18:35:14
As pointed out by randomuser22: 2017-09-02 05:10:43
0 is the last input after all of the inputs, not the last input after each.

5 4 3 1 2
5 4 3 1 2
5 4 3 1 2

5 4 3 1 2
5 4 3 1 2

thanks a lot dude!

aaryan6600: 2018-11-26 10:15:09

why is it ad-hoc !?

wompowe: 2018-10-30 00:09:32

the style of input is very important and stack corner case in important as well

k_chaitanya98: 2018-10-20 16:20:33

can somebody explain the problem? Is it about sort able or not ?

sagarbathla50: 2018-09-26 20:29:17

how to solve problem i didnt get it anyone please help

Added by:Patryk Pomykalski
Time limit:1s-2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: NODEJS PERL6 VB.NET
Resource:Swiss Olympiad in Informatics 2004