Symmetric Order（POJ-2013）

最新推荐文章于 2020-11-01 14:23:35 发布

猫的旅途

最新推荐文章于 2020-11-01 14:23:35 发布

阅读量327

点赞数 2

本文链接：https://blog.csdn.net/Struggle_0/article/details/107420644

版权

题目要求将按长度非递减顺序排列的字符串集合，改造成对称输出形式，最短字符串位于顶部和底部，最长在中间。可以采用非递归或递归方法实现。

摘要由CSDN通过智能技术生成

Symmetric Order

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 16689		Accepted: 9497

Description

In your job at Albatross Circus Management (yes, it's run by a bunch of clowns), you have just finished writing a program whose output is a list of names in nondescending order by length (so that each name is at least as long as the one preceding it). However, your boss does not like the way the output looks, and instead wants the output to appear more symmetric, with the shorter strings at the top and bottom and the longer strings in the middle. His rule is that each pair of names belongs on opposite ends of the list, and the first name in the pair is always in the top part of the list. In the first example set below, Bo and Pat are the first pair, Jean and Kevin the second pair, etc.

Input

The input consists of one or more sets of strings, followed by a final line containing only the value 0. Each set