Score : 700 points
Determine if there exists a sequence obtained by permuting 1,2,...,N that satisfies the following conditions:
If it exists, construct one such sequence.
A subsequence of a sequence P is a sequence that can be obtained by extracting some of the elements in P without changing the order.
A longest increasing subsequence of a sequence P is a sequence with the maximum length among the subsequences of P that are monotonically increasing.
Similarly, a longest decreasing subsequence of a sequence P is a sequence with the maximum length among the subsequences of P that are monotonically decreasing.
Input is given from Standard Input in the following format:
N A B
If there are no sequences that satisfy the conditions, print -1
.
Otherwise, print N integers. The i-th integer should be the i-th element of the sequence that you constructed.
5 3 2
2 4 1 5 3
One longest increasing subsequence of this sequence is {2,4,5}, and one longest decreasing subsequence of it is {4,3}.
7 7 1
1 2 3 4 5 6 7
300000 300000 300000
-1