| Submit | All submissions | Best solutions | Back to list |
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:
| 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 |
hide comments
|
||||||||||||||
|
2020-03-10 13:24:07
please focus on input like this : 5 5 1 2 4 3 5 4 1 5 3 2 0 |
||||||||||||||
|
2020-02-22 20:36:17
tks warri00r helped a lot |
||||||||||||||
|
2020-02-04 06:02:40
this test case was helpful AC in 2 try!!! 10 1 2 10 5 4 3 7 6 8 9 0 yes |
||||||||||||||
|
2020-01-27 08:37:25
Getting an AC at one go after a long time.....Real confidence booster! |
||||||||||||||
|
2020-01-16 08:23:19
Cost me two days to solve this :(( |
||||||||||||||
|
2020-01-09 06:22:48
Input statement is confusing otherwise an easy stack question... Thanks to abhay patro for clearing out the correct input format :P !! |
||||||||||||||
|
2020-01-05 10:16:28
AC in two go cout << yes instead of YES =(((( Last edit: 2020-01-05 14:05:12 |
||||||||||||||
|
2020-01-05 09:49:59
poor statement |
||||||||||||||
|
2020-01-01 11:22:56
acceptedddd!!!! thank to abhaypatro try this 10 1 2 10 5 4 3 7 6 8 9 0 yes and the input is like this 5 5 1 2 4 3 5 4 1 5 3 2 0 OUTPUT yes no |
||||||||||||||
|
2019-12-14 14:53:04
Try solving the problem without looking at the test cases in the comments. Looking at the test cases makes it way easier to understand the logic for this problem so try solving it by yourself first. |
||||||||||||||
RSS