2833. Lumberjack Sequencing

单点时限: 5.0 sec

内存限制: 256 MB

Another tale of lumberjacks?. Let see …

The lumberjacks are rude, bearded workers, while foremen tend to be bossy and simpleminded. The foremen like to harass the lumberjacks by making them line up in groups of ten, ordered by the length of their beards. The lumberjacks, being of different physical heights, vary their arrangements to confuse the foremen. Therefore, the foremen must actually measure the beards in centimeters to see if everyone is lined up in order. Your task is to write a program to assist the foremen in determining whether or not the lumberjacks are lined up properly, either from shortest to longest beard or from longest to shortest.


The input starts with line containing a single integer N, 0 < N < 20, which is the number of groups to process. Following this are N lines, each containing ten distinct positive integers less than 100.


There is a title line, then one line per set of beard lengths. See the sample output for capitalization and punctuation.


13 25 39 40 55 62 68 77 88 95
88 62 77 20 40 10 99 56 45 36
91 78 61 59 54 49 43 33 26 18

144 人解决,153 人已尝试。

159 份提交通过,共有 272 份提交。

1.9 EMB 奖励。

创建: 10 年,3 月前.

修改: 3 年,5 月前.

最后提交: 1 月,2 周前.

来源: Mexico 2010