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
shashankchdhry: 2020-04-13 16:32:39

@warri00r thanks a lot. That test case was really helpful.
Making a tough test case is a very valuable skill, I should start to think in that way.
For those who are getting a hard time with this question, JUST SIMULATE IT MANUALLY FIRST.

anant_2308: 2020-04-11 13:54:20

AC in one go....just think when will the output will be no...

tech_niks: 2020-04-09 19:02:52

Very Simple if You use stack and queue both.

akarsh777: 2020-04-09 08:19:17

rula diya thaa ye question!!

atharvazzz: 2020-04-07 23:32:33

Nice problem :)
AC in one go.

noobmaster__69: 2020-04-03 08:33:58

it will continue to take input till you get n==0

aanchal_890: 2020-03-26 11:30:30

how to handle this 0

rahulsingh40g: 2020-03-20 12:35:36

Are not we able to see the test cases here at spoj?
if yes, then please tell how.

kuchoniaatahai: 2020-03-10 13:24:07

please focus on input like this :
5 1 2 4 3
4 1 5 3 2

pedroslrey: 2020-02-22 20:36:17

tks warri00r helped a lot

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