SPCU - Gopu and Validity of Arrangement
N persons are standing in a line. Height of each person is between 1 and N and height of each person is distinct.
You are given an array A where A[i] denotes how many persons are there before the i_th person having heights greater than the height of the ith person. For a person i, all the persons from 1 to i - 1 are considered to be before him. eg, For person 2, person 1 is considered before him.
You have to find out whether this array can be valid for some arrangement of persons. If you can uniquely do so then output "YES" Otherwise output "NO".
First line contains T : number of test cases. (1 <= T <= 20).
For each test First line contains an integer n. (1 <= N <= 10^5)
Next line contains n space seperated integers denoting A[i]. (0 <= A[i] <= N)
For each test case, output "YES" or "NO" according to answer.
For the first test case, [2, 1] is a valid case, First person has height 2, second person has height 1.
For the second test case, no valid test case exists.
why it is showing the wrong answer even though my logic is correct
Don't think too much, its a trick question
please anyone can give me some another example when the print is coming " no".
Move this to tutorial
One of the easiest question I have ever solved! :P :D
easy question,just find the logic.
Its amazing how a matter of time impacts your performance in coding. 3 months ago, I got 5-6 WA's on this, and today it took me 5 minutes to solve this. I am laughing at myself from 3 months ago.. :D
don't care of test case take your own test case
My 250th ... :D
Easy ques. But, beware of the white spaces in some of the test cases.. :P