[动态规划]Pku1159--Palindrome
来源:互联网 发布:台湾统一时间 知乎 编辑:程序博客网 时间:2024/06/08 05:56
http://acm.pku.edu.cn/JudgeOnline/problem?id=1159
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 27432 Accepted: 9174
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
题目大意:给出一个字符串,问最少插入多少个字符让这个串变成回文串。
分析:可以直接dp。令f[i,j]表示从i到j最少需要插入多少个字符这个串才变成回文串。
f[i,j]=f[i+1,j-1] (a[i]=a[j])
f[i,j]=min(f[i+1,j]+1,f[i,j-1]+1)。
也可以求原串和反串的最长公共子串,再用长度减去。其实本质是相同的。
恶心的是,这题内存限制比较小,都开longint会超内存..
用max函数的话,容易超时...
题目没说,其实是多组测试数据..而且pascal一定要用seekeof= =
c的话,类型用unsigned可以了。
codes:
- [动态规划]Pku1159--Palindrome
- PKU1159 palindrome
- pku1159 Palindrome DP
- POJ1159 Palindrome 【动态规划】
- hdu1513 Palindrome 动态规划
- 动态规划之Palindrome
- Palindrome POJ 1159 动态规划
- poj 1159 Palindrome 动态规划
- 【动态规划】【poj 1159】palindrome
- Palindrome Partitioning与动态规划
- poj 1159 palindrome-----动态规划
- POJ1159 Palindrome (动态规划)
- POJ3280*Cheapest Palindrome题解动态规划DP
- POJ-1159-Palindrome-回文-动态规划
- codeforces D. Palindrome pairs 动态规划
- Palindrome (动态规划) 构成回文串
- poj1159 palindrome(动态规划+滚动数组)
- 动态规划——Poj 1159 Palindrome
- .net异常之 StackOverflowException(堆栈溢出)
- (ZJU-2005复试)-HDOJ-1232-畅通工程
- html,html服务器控件,asp。net服务器控件 区别,以及 onclick ,onserverclick ,onclientclick 事件....
- SQL 2005镜像手册(不含见证服务器)
- (ZJU-2005复试)-HDOJ-1234-开门人和关门人
- [动态规划]Pku1159--Palindrome
- Java面试算法题目
- 关于SPI协议及驱动开发
- php——include语句
- JamLegend 已突破百万注册用户
- Dreamweaver链接MySql405错误
- 贝叶斯模型
- (ZJU-2005复试)-HDOJ-1236-排名
- shell 脚本中一些特殊符号