poj 1159Palindrome(dp lcs变形)
来源:互联网 发布:mac 系统怎么翻墙 编辑:程序博客网 时间:2024/06/11 11:21
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 60328 Accepted: 21010
Description
A palindrome(回文) is asymmetrical(匀称的) string, that is, a string readidentically(同一地) from left to right as well as from right to left. You are to write a program which, given a string, determines theminimal(最低的) number of characters to be inserted into the string in order to obtain a palindrome.
As an example, by inserting 2 characters, the string "Ab3bd" can be transformed(改变) into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.
As an example, by inserting 2 characters, the string "Ab3bd" can be transformed(改变) into a palindrome ("dAb3bAd" or "Adb3bdA"). However, inserting fewer than 2 characters does not produce a palindrome.
Input
Your program is to read from standard input(投入). The first line contains oneinteger(整数): the length of the input string N, 3 <= N <= 5000. The second line contains one string with length N. The string is formed fromuppercase(以大写字母印刷) letters from 'A' to 'Z',lowercase(小写字母) letters from 'a' to 'z' anddigits(数字) from '0' to '9'. Uppercase and lowercase letters are to be considereddistinct(明显的).
Output
Your program is to write to standard output(输出). The first line contains oneinteger(整数), which is the desiredminimal(最低的) number.
Sample Input
5Ab3bd
Sample Output
2//用int MLE 改成short就ac了 添加最少字母 其实就是 在给定的字符串里里面找最长的回文串 然后剪掉最长的剩下的就是你要最少补充的了~~~~最长回文 就是正着读和到着读 最长的公共子序列 恩 就这么简单#include<stdio.h>#include<string.h>#define max(a,b) a>b?a:bshort dp[5001][5001];char x[5000],y[5000];int main(){ int n; int i,j,k; while(~scanf("%d",&n)) { scanf("%s",x); for(i=n-1,j=0;i>=0;i--) y[j++]=x[i]; dp[0][0]=0; for(i=1;i<=n;i++) { dp[i][0]=0; dp[0][i]=0; } for(i=1;i<=n;i++) for(j=1;j<=n;j++) { if(x[i-1]==y[j-1]) dp[i][j]=dp[i-1][j-1]+1; else dp[i][j]=max(dp[i-1][j],dp[i][j-1]); } printf("%d\n",n-dp[n][n]); }}
0 0
- POJ 1159-Palindrome(DP/LCS变形)
- poj 1159Palindrome(dp lcs变形)
- poj 1159 Palindrome(lcs类似dp)
- POJ 1159 Palindrome(DP LCS&滚动数组)
- poj 1159 Palindrome LCS
- poj 1159 Palindrome LCS
- poj 1159 Palindrome (LCS)
- Palindrome POJ 1159 【LCS】
- poj 1159 Palindrome (DP:LCS+滚动数组)
- POJ-1159-Palindrome-lcs扩展
- POJ 1159 Palindrome (LCS)
- POJ 1159 Palindrome (LCS)
- hdoj 1513 Palindrome (LCS 变形)
- poj1159 Palindrome DP,lcs
- POJ-1080- Human Gene Functions-DP-LCS变形
- POJ Human Gene Functions 1080 lcs 变形 DP
- poj 1080Human Gene Functions(dp lcs 变形)
- dp poj 1159 Palindrome
- Hive on Spark源码分析(六)—— RemoteSparkJobMonitor与JobHandle
- 防止出现 Capturing 'self' strongly in this block is likely to lead to a retain cycle [duplicate]
- poj 3009 Curling2.0(dfs)
- 初学Hibernate经验
- 用户体验之自定义Toast,拿过来直接用(Toast的重复显示)
- poj 1159Palindrome(dp lcs变形)
- js遍历数组的方法
- colo.xml
- IT工程师怎样预防、治好颈椎腰椎伤肾等职业病
- 利用CSS和DIV的几种布局方法(1)
- Java:函数,类,数组之间的运用
- hadoop快速入门,伪分布式模式安装
- 什么是线程安全和线程不安全
- [34] Vijos P1002 过河(动态规划+状态压缩)