2017.4.17解题报告f

徐江  sdxy.hustoj.com

f

问题

状态

排名

竞赛&作业

[

问题

状态

排名

OI排名

统计

]

登录

欢迎关注微信公众号onlinejudge

问题 F: SUBSTRING

时间限制: 1 Sec  内存限制: 128 MB

提交: 9  解决: 3

[提交][状态][讨论版]

题目描述

You are given a string input. You are to find the longest substring of input such that the reversal of the

substring is also a substring of input. In case of a tie, return the string that occurs earliest in input.

 

Note well: The substring and its reversal may overlap partially or completely. The entire original string

is itself a valid substring .

The best we can do is find a one character substring, so we implement the tiebreaker rule of taking the

earliest one first.

输入

The first line of input gives a single integer, 1 ≤ N ≤10,  the number of test cases. Then follow, for each

 test case,  a  line  containing between 1 and 50 characters, inclusive. Each character of input will be an

uppercase letter ('A'-'Z').

输出

Output for each test case  the longest substring of input such that the reversal of the substring is also a

substring of input

样例输入

3     

ABCABA

XYZ

XCVCX

样例输出

ABA

X

XCVCX

提示

[提交][状态]

题意概括：把字符串逆序，如果逆序后的字符串中的子串在原串中也出现就输出，如果有多个，输出长度最长的子串。如果长度相等输出第一个。