“Commander! Commander! Please wake up commander!”
“... mmmph. What time is it?”
“4:07 am, Commander. The following message just arrived on the emergency zeta priority classified scrambler, marked your eyes only.”
You grudgingly take the letter, rub the sleep from your eyes, fleetingly wish that the ’Backer closed at an earlier hour, and start to read.
To make things worse, you remeber that SDI has a fatal flaw due to the budget cuts. When SDI sends out missles to intercept the targets, every missle has to fly higher than the previous one. In other words, once you hit a target, the next target can only be among the ones that are flying at higher altitudes than the one you just hit.
For example, if the missles are flying toward you at heights of 1, 6, 2, 3 and 5 (arriving in that order), you can try to intercept the first two, but then you won’t be able to get the ones flying at 2, 3, 5 because they are lower than 6. Your job is to hit as many targets as possible. So you have to quickly write a program to find the best sequence of targets that the flawed SDI program is going to destroy.
Begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.
The input to your program will consist of a sequence of integer altitudes, each on a separate line. Each test case contains no more than 10000 integers.
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.
Output from your program should contain the maximum number of targets you can hit, followed by the altitudes of those targets, one per line, in the order of their arrivals.