hdu1513——Palindrome
来源:互联网 发布:php sql 防注入函数 编辑:程序博客网 时间:2024/06/05 20:42
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3281 Accepted Submission(s): 1136
Problem Description
A palindrome is a symmetrical string, that is, a string read identically from left to right as well as from right to left. You are to write a program which, given a string, determines the minimal 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 one integer: the length of the input string N, 3 <= N <= 5000. The second line contains one string with length N. The string is formed from uppercase letters from 'A' to 'Z', lowercase letters from 'a' to 'z' and digits from '0' to '9'. Uppercase and lowercase letters are to be considered distinct.
Output
Your program is to write to standard output. The first line contains one integer, which is the desired minimal number.
Sample Input
5Ab3bd
Sample Output
2
Source
IOI 2000
Recommend
linle | We have carefully selected several similar problems for you: 1505 1074 1510 1024 1058
Statistic | Submit | Discuss | Note
LCS,加个滚动数组
#include <map>#include <set>#include <list>#include <queue>#include <stack>#include <vector>#include <cmath>#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>#include <algorithm>using namespace std;int dp[2][5010];char a[5010], b[5010];int main(){int n;while (~scanf("%d", &n)){scanf("%s", a);for (int i = 0; i < n; i++){b[i] = a[n - i - 1];}b[n] = '\0';for (int i = 0; i <= n; i++){dp[0][i] = 0;dp[1][i] = 0;}for (int i = 1; i <= n; i++){for (int j = 1; j <= n; j++){if (a[i - 1] == b[j - 1]){dp[i % 2][j] = dp[1 - i % 2][j - 1] + 1;}else{dp[i % 2][j] = max(dp[1 - i % 2][j], dp[i % 2][j - 1]);}}}printf("%d\n", n - dp[n % 2][n]);}return 0;}
0 0
- hdu1513——Palindrome
- HDU1513:Palindrome
- hdu1513 Palindrome
- 【HDU1513】【Palindrome】
- HDU1513:Palindrome
- hdu1513 Palindrome
- HDU1513 && POJ1159:Palindrome(LCS)
- Palindrome(hdu1513(LCS))
- hdu1513 Palindrome 动态规划
- HDU1513:Palindrome 【LCS】
- HDU1513 Palindrome(LCS+滚动数组)
- hdu1513&&poj 1159 Palindrome(LCS+滚动数组)
- HDU1513 && POJ1159 Palindrome 最长公共子序列
- hdu1513 Palindrome(LCS+滚动数组)
- hdu1513
- Palindrome(补全回文串+最长公共子序列的应用)hdu1513+poj1159+动态规划
- hdu1513 dp
- POJ1159——Palindrome
- GPS北斗双模技术应用开发研究—数据结构扩展
- 操作,Emacs]关于调整窗口大小及简单的文件对比
- 圆的表面积和体积的计算
- 在xcode调试断点不能停在代码区的终极解决方案
- 第十四周项目4:电子词典——二分法查找
- hdu1513——Palindrome
- Silverlight应用程序中未处理的错误代码:2104 类别:InitializeError
- table的css样式
- 布局文件下控件的选择
- 环境配置和开发时间
- qt 之 QObject
- poj 2251
- Linux对外开放端口
- Eclipse 字体调整