CF1799C.Double Lexicographically Minimum
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given a string s . You can reorder the characters to form a string t . Define tmax to be the lexicographical maximum of t and t in reverse order.
Given s determine the lexicographically minimum value of tmax over all reorderings t of s .
A string a is lexicographically smaller than a string b if and only if one of the following holds:
- a is a prefix of b , but a=b ;
- in the first position where a and b differ, the string a has a letter that appears earlier in the alphabet than the corresponding letter in b .
输入格式
The first line contains a single integer t ( 1≤t≤105 ) — the number of test cases. Descriptions of test cases follow.
The first and only line of each test case contains a string s ( 1≤∣s∣≤105 ). s consists of only lowercase English letters.
It is guaranteed that the sum of ∣s∣ over all test cases does not exceed 105 .
输出格式
For each test case print the lexicographically minimum value of tmax over all reorderings t of s .
输入输出样例
输入#1
12 a aab abb abc aabb aabbb aaabb abbb abbbb abbcc eaga ffcaba
输出#1
a aba bab bca abba abbba ababa bbab bbabb bbcca agea acffba
说明/提示
For the first test case, there is only one reordering of s , namely "a".
For the second test case, there are three reorderings of s .
- t=aab : tmax=max(aab,baa)=baa
- t=aba : tmax=max(aba,aba)=aba
- t=baa : tmax=max(baa,aab)=baa
The lexicographical minimum of tmax over all cases is "aba".