#K51512. Strictly Increasing Sequence
Strictly Increasing Sequence
Strictly Increasing Sequence
You are given T test cases. For each test case, you are provided with an integer n representing the length of a sequence and then a sequence of n integers. Your task is to determine whether the sequence is strictly increasing.
A sequence \(a_1, a_2, \ldots, a_n\) is strictly increasing if and only if \(a_1 < a_2 < \cdots < a_n\). If the sequence satisfies this property, print "Yes"; otherwise, print "No" for that test case.
Note: Read the input from standard input and send the output to standard output.
inputFormat
The first line contains a single integer T, representing the number of test cases. For each test case, the first line contains an integer n (the length of the sequence), followed by a line with n integers separated by spaces.
For example:
2 4 1 2 3 4 5 5 4 3 2 1
outputFormat
For each test case, output a single line containing either "Yes" if the sequence is strictly increasing, or "No" otherwise.
For the sample input above, the output should be:
Yes No## sample
2
4
1 2 3 4
5
5 4 3 2 1
Yes
No
</p>