28059번 - Remix 서브태스크스페셜 저지다국어

You are given a multiset $s$ consisting of $n$ integers. You should perform the following three-step operation some number of times until a single integer remains in $s$.

• Choose a multiset $t$ such that $t \subseteq s$ and $|t| \ge 2$.
• Erase the elements of $t$ from $s$.
• Insert $\max(t) - \min(t)$ to $s$.

Find a sequence of operations that maximizes the integer left in $s$.

The first line contains a single integer $n$ $(2 \le n \le 10^5)$.

The second line contains $n$ integers $s_1, s_2, \ldots, s_n$ $(0 \le s_i \le 10^5)$.

On the first line, print a single integer $k$ $(1 \le k \le n-1)$, the number of operations.

On each of the next $k$ lines, print an integer $m$ $(2 \le m \le n)$, the size of the chosen multiset $t$, followed by $m$ integers, $t_1, t_2, \ldots, t_m$.

Note that the operations are executed in the same order they are listed. So, for each operation, $t$ must be a subset of $s$ when all the preceding operations are performed.

The sample does the following operations:

The values underlined in $s$ denote the integer inserted. After the fourth operation, $s$ is reduced to a single integer value of $94$. It can be shown that no other sequence of operations results in a larger value.