CF10D LCIS
Description
This problem differs from one which was on the online contest.
The sequence $ a_{1},a_{2},...,a_{n} $ is called increasing, if $ a_{i}
Input Format
The first line contains an integer $ n $ ( $ 1
Output Format
In the first line output $ k $ — the length of the longest common increasing subsequence. In the second line output the subsequence itself. Separate the elements with a space. If there are several solutions, output any.