将每个字符串翻转后得到一个新的字符串,再与原串找最长公共子序列就行了
(话说我竟然卡在了字典序的问题上良久,还是string好搞,用char的时候打渣了WA了几次,就不想用它了)
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
int dp[1000][1000];
struct strin
{
string s;
int num;
}a[50000];
bool cmp(strin a,strin b)
{
if(a.num != b.num )
return a.num >b.num ;
return a.s < b.s;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 1 ; i <= n ; i ++)
{
memset(dp,0,sizeof(dp));
cin>>a[i].s;
int lena = a[i].s.length();
string ss;
for(int j = 0; j < lena ; j ++)
{
ss[lena-j-1] = a[i].s[j];
}
for(int j = 1; j <= lena ; j ++)
{
for(int k = 1; k <= lena; k ++)
{
if(ss[j-1] != a[i].s[k-1])
dp[j][k] = max(max(dp[j-1][k],dp[j][k-1]),dp[j-1][k-1]);
else
dp[j][k] = max(max(dp[j-1][k],dp[j][k-1]),dp[j-1][k-1]+1);
}
}
a[i].num = dp[lena][lena];
}
sort(a+1,a+1+n,cmp);
for(int i = 1; i <= n; i ++)
{
cout <<a[i].s <<endl;
}
return 0;
}