题意:输入一个n(2
≤n≤1000,n是偶数)个字符串的集合D,找一个长度最短的字符串(不一定在D中出现)S,使得D中恰好一半串小于等于S,另一半串大于S。如果有多解,输出字典序最小的解。例如,对于{JOSEPHINE,JERRY},输出JF;对于{FRED,FREDDIE}输出FRED。(本段摘自《算法竞赛入门经典(第2版)》)
分析:基本想法是是对字符串按字典序排序,然后只需处理中间的两个字符串就可以了。主要是对细节的处理要注意。
代码:
#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
#include <string>
using namespace std;
const int maxn = 1005;
int n, l, l1, l2;
string s, s1, s2, tmp;
string a[maxn];
int main()
{
while (~scanf("%d", &n), n)
{
s = "";
for (int i = 0; i < n; ++i)
cin >> a[i];
sort(a, a + n);
s1 = a[n / 2 - 1];
s2 = a[n / 2];
l1 = s1.size();
l2 = s2.size();
l = min(l1, l2);
for (int i = 0; i < l; ++i)
if (s1[i] == s2[i])
s += s1[i];
else
{
tmp = s + (char)(s1[i] + 1);
if (tmp == s2)
{
s += s1[i++];
while (i < l1 - 1 && s1[i] == 'Z')
s += s1[i++];
if (i < l1 - 1)
s += (char)(s1[i] + 1);
else
s = s1;
}
else
{
if (tmp.size() == l1)
s = s1;
else
s = tmp;
}
break;
}
cout << s << '\n';
}
return 0;
}