UVa 11404 - Palindromic Subsequence DP LCS---------无限WA
摘要:
Palindromic SubsequenceA Subsequence is a sequence obtained by deleting zero or more characters in a string. A Palindrome is a string which when read from left to right, reads same as when read from right to left. Given a string, find the longest palindromic subsequence. If there are many answers to 阅读全文
posted @ 2013-04-27 21:11 电子幼体 阅读(210) 评论(0) 推荐(0) 编辑