Digits Sequence Dividing

题意翻译

你有一个由 $n$ 个由 $0$ 到 $9$ 之间的数组成的序列 $s$。 你必须最少把它分成两段，使得每一段组成的数字都比前一段组成的数字大。 输入第一行一个 $q$，表示询问的组数。 接下来有 $q$ 组询问，每一组询问第一行是一个整数 $n$，第二行为这个序列 $s$。 如果可以，输出 `YES`，并输出你的分割方案，否则，输出 `NO`。

题目描述

You are given a sequence $ s $ consisting of $ n $ digits from $ 1 $ to $ 9 $ . You have to divide it into at least two segments (segment — is a consecutive sequence of elements) (in other words, you have to place separators between some digits of the sequence) in such a way that each element belongs to exactly one segment and if the resulting division will be represented as an integer numbers sequence then each next element of this sequence will be strictly greater than the previous one. More formally: if the resulting division of the sequence is $ t_1, t_2, \dots, t_k $ , where $ k $ is the number of element in a division, then for each $ i $ from $ 1 $ to $ k-1 $ the condition $ t_{i} < t_{i + 1} $ (using numerical comparing, it means that the integer representations of strings are compared) should be satisfied. For example, if $ s=654 $ then you can divide it into parts $ [6, 54] $ and it will be suitable division. But if you will divide it into parts $ [65, 4] $ then it will be bad division because $ 65 > 4 $ . If $ s=123 $ then you can divide it into parts $ [1, 23] $ , $ [1, 2, 3] $ but not into parts $ [12, 3] $ . Your task is to find any suitable division for each of the $ q $ independent queries.

输入输出格式

输入格式

The first line of the input contains one integer $ q $ ( $ 1 \le q \le 300 $ ) — the number of queries. The first line of the $ i $ -th query contains one integer number $ n_i $ ( $ 2 \le n_i \le 300 $ ) — the number of digits in the $ i $ -th query. The second line of the $ i $ -th query contains one string $ s_i $ of length $ n_i $ consisting only of digits from $ 1 $ to $ 9 $ .

输出格式

If the sequence of digits in the $ i $ -th query cannot be divided into at least two parts in a way described in the problem statement, print the single line "NO" for this query. Otherwise in the first line of the answer to this query print "YES", on the second line print $ k_i $ — the number of parts in your division of the $ i $ -th query sequence and in the third line print $ k_i $ strings $ t_{i, 1}, t_{i, 2}, \dots, t_{i, k_i} $ — your division. Parts should be printed in order of the initial string digits. It means that if you write the parts one after another without changing their order then you'll get the string $ s_i $ . See examples for better understanding.

输入输出样例

输入样例 #1

4
6
654321
4
1337
2
33
4
2122

输出样例 #1

YES
3
6 54 321
YES
3
1 3 37
NO
YES
2
21 22

题意翻译

你有一个由 $n$ 个由 $0$ 到 $9$ 之间的数组成的序列 $s$。 你必须最少把它分成两段，使得每一段组成的数字都比前一段组成的数字大。 输入第一行一个 $q$，表示询问的组数。 接下来有 $q$ 组询问，每一组询问第一行是一个整数 $n$，第二行为这个序列 $s$。 如果可以，输出 `YES`，并输出你的分割方案，否则，输出 `NO`。