http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2092
思路:求的是非连续子串的最长回文,而n<1000,所以可以用LCS(s,strrev(s))过。
完整代码:
/*0.075s*/
#include<bits/stdc++.h>
using namespace std;
char a[1005], b[1005];
int f[1005][1005];
int main()
{
int T, len, i, j;
scanf("%d", &T);
getchar();
while (T--)
{
gets(a);
len = strlen(a);
for (i = 0 ; i < len ; ++ i)
b[len - i - 1] = a[i];
memset(f, 0, sizeof(f));
for (i = 1 ; i <= len ; ++ i)
for (j = 1 ; j <= len ; ++ j)
if (a[i - 1] == b[j - 1]) f[i][j] = f[i - 1][j - 1] + 1;
else f[i][j] = max(f[i - 1][j], f[i][j - 1]);
printf("%d\n", f[len][len]);
}
return 0;
}