HDU 1513 Palindrome(思维,DP)
来源:互联网 发布:java安装教程 编辑:程序博客网 时间:2024/06/13 07:34
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5751 Accepted Submission(s): 1927
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
题意:给出一个长度为n的字符串,求最少添加几个字符可令其变成一个回文串
思路:假设我们有字符串a,其最少添加字符就等于 n - a和a的反串的最长公共子序列长度,因为数据太大会 MLE ,我们需要用滚动数组优化一下。
#include<bits/stdc++.h>using namespace std;const int N = 5000 + 10;char a[N],b[N];int dp[2][N];int main(){ int n; while(scanf("%d",&n)==1) { scanf("%s",a); for(int i=0;i<n;i++) b[i]=a[n-i-1]; memset(dp,0,sizeof(dp)); 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[(i-1)%2][j-1]+1; else dp[i%2][j]=max(dp[(i-1)%2][j],dp[i%2][j-1]); } } printf("%d\n",n-dp[n%2][n]); }}
0 0
- HDU 1513 Palindrome(思维,DP)
- HDU 1513 Palindrome dp
- HDU 1513 Palindrome DP
- HDU 1513 Palindrome(DP)
- Hdu 1513 Palindrome【思维+Lcs+滚动数组】
- !HDU 1513 Palindrome--dp--(最长公共子序列模型)
- hdu 1513 Palindrome(dp 回文子序列)
- hdu 4632 Palindrome subsequence(DP)
- hdu - 4632 - Palindrome subsequence(dp)
- 【HDU】4632 Palindrome subsequence (DP)
- HDU 4632 Palindrome subsequence(区间dp)
- hdu 4618 Palindrome Sub-Array(dp)
- hdu 4632 Palindrome subsequence(dp)
- HDU Palindrome subsequence(区间DP)
- HDU 4632 Palindrome subsequence (区间DP)
- HDU 5760 Palindrome Bo(dp)
- HDU 6156 Palindrome Function(数位DP)
- HDU 6156 Palindrome Function (数位dp)
- Android studio 去除版本控制
- 【SSH进阶之路】Hibernate基本映射(三)
- 【计算机系统结构】 计算机系统结构的基本概念
- HDU 1016 http://acm.hdu.edu.cn/showproblem.php?pid=1016
- 【SSH进阶之路】Hibernate映射——多对一单向关联映射(四)
- HDU 1513 Palindrome(思维,DP)
- Android Studio导入图片后编译出错
- tf基础操作
- RMQ算法
- 【计算机系统结构】 计算机指令集结构
- Android 种导入程序id会报空指针
- POJ 1143 (记忆化搜索,状态压缩,博弈论记忆化搜索实现)
- HDU 1016
- JSONP解决跨域访问数据问题