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.

Input

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.

Output

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.

Example

Sample input:
5
5 1 2 4 3 
0

Sample output:
yes

Illustration

The sample input reflects the following situation:

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


hide comments
zhadyrassyn: 2019-03-13 09:54:26

@iamthedanger Thank you. I was struggling for some days. And today your comment made my day!

Last edit: 2019-03-13 09:54:55
iamthedanger: 2019-03-13 08:47:08

this contains some additional testcases try using them:https://www.quora.com/How-can-I-solve-a-STPAR-problem-on-SPOJ-when-my-code-is-giving-the-right-answers-for-the-test-cases-which-were-discussed-in-the-form-but-it-is-still-giving-me-WA

Last edit: 2019-03-13 08:47:47
green_pepper: 2019-03-06 23:39:07

What's with the input/output? I can't figure this out??? All test cases in comments return correct answers?? I've tried writing the answer after each input, after all inputs, but I still get wrong answer... Any suggestions what I'm doing wrong??

knir0103: 2019-03-04 17:30:31

notice strictly that "a truck cannot drive back and re-enter the side street or the approach street.", u will get AC easier

vashist99: 2019-03-01 08:38:35

what would the output be for
5
5 2 1 4 3
or
Are the love mobiles supposed to enter from the side streets only after the rest of the caravan has passed or can they enter in between?

Last edit: 2019-03-01 08:41:47
zakir068: 2019-02-26 07:34:29

the required order is in this problem is 1 2 3 4 ... n .
And also check
5
4 2 3 5 1 should be no

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.
eg:
5
5 4 3 2 1
3
2 3 1
0


Added by:Patryk Pomykalski
Date:2004-07-01
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