uva 11151 - Longest Palindrome
来源:互联网 发布:17173数据库 编辑:程序博客网 时间:2024/06/05 20:43
Problem D: Longest Palindrome
Time limit: 10 seconds
A palindrome is a string that reads the same from the left as it does from the right. For example, I, GAG and MADAM are palindromes, but ADAM is not. Here, we consider also the empty string as a palindrome.
From any non-palindromic string, you can always take away some letters, and get a palindromic subsequence. For example, given the string ADAM, you remove the letter M and get a palindrome ADA.
Write a program to determine the length of the longest palindrome you can get from a string.
Input and Output
The first line of input contains an integer T (≤ 60). Each of the next T lines is a string, whose length is always less than 1000.
For ≥90% of the test cases, string length ≤ 255.
For each input string, your program should print the length of the longest palindrome you can get by removing zero or more characters from it.
Sample Input
2ADAMMADAM
Sample Output
35
#include<cstdio>#include<iostream>#include<cstring>#define Maxn 1010using namespace std;int dp[Maxn][Maxn];char s[Maxn];int main(){ int t; scanf("%d%*c",&t); while(t--){ gets(s); int n=strlen(s); for(int i=0;i<n;i++){ dp[i][i]=1; if(s[i]==s[i+1]) dp[i][i+1]=2; else dp[i][i+1]=1; } for(int l=2;l<n;l++) for(int i=0,j=l;j<n;i++,j++) if(s[i]==s[j]) dp[i][j]=dp[i+1][j-1]+2; else dp[i][j]=max(dp[i][j-1],dp[i+1][j]); printf("%d\n",dp[0][n-1]); }return 0;}
- uva 11151 Longest Palindrome
- UVa 11151 - Longest Palindrome
- UVA 11151 Longest Palindrome
- Uva 11151 - Longest Palindrome
- UVa 11151 - Longest Palindrome
- uva 11151 - Longest Palindrome
- UVa:11151 Longest Palindrome
- UVA - 11151 Longest Palindrome
- uva 11151 - Longest Palindrome
- UVA - 11151 Longest Palindrome
- UVA 11151 - Longest Palindrome
- UVA - 11151 Longest Palindrome
- uva 11151Longest Palindrome
- Longest Palindrome - UVa 11151 dp
- UVa 11151 - Longest Palindrome 字符串dp
- uva 11151 Longest Palindrome(LCS)
- UVA - 11151 Longest Palindrome 最长回文字符串
- UVa 11151 - Longest Palindrome(区间dp)
- ios7下全屏隐藏导航条
- 精妙SQL语句
- 博弈 个人 见解
- Paths through the Hourglass - UVa 10564 dp
- Android学习路线(九)为Action Bar添加Style
- uva 11151 - Longest Palindrome
- ORACLE常用命令
- Intent 详解
- tyvj1307 kruskal+并查集 最小生成树
- 乱码问题的分类
- java获得ip地址(一)
- post和get的区别
- 浅谈HTTP中Get与Post的区别
- 堆排序