杭电 1513 Palindrome LCS DP
来源:互联网 发布:java 垃圾评论过滤 编辑:程序博客网 时间:2024/06/05 22:49
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3955 Accepted Submission(s): 1349
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
第一次用滚动数组,感觉自己萌萌哒QAQ。
嘛,滚动数组其实并不难,关键是要用i来确定,这样会比较方便点。虽然还是有点小不理解吧,不过这都不是事儿~
#include<stdio.h>#include<string.h>#define maxn 5000+10#define max(a,b) (a>b?a:b)char s1[maxn],s2[maxn];int dp[2][maxn];int main(){int n;while(~scanf("%d",&n)){scanf("%s",s1);strcpy(s2,s1);strrev(s2);memset(dp,0,sizeof(dp));int i,j,x=0,y=1;for(i=1;i<=n;i++){for(j=1;j<=n;j++){x=i%2;y=1-x;if(s1[i-1]==s2[j-1])dp[x][j]=dp[y][j-1]+1;elsedp[x][j]=max(dp[y][j],dp[x][j-1]);}}printf("%d\n",n-dp[n%2][n]);}return 0;}
0 0
- 杭电 1513 Palindrome LCS DP
- 杭电 1513 Palindrome(LCS)
- 杭电-1513Palindrome(LCS+滚动数组)
- poj1159 Palindrome DP,lcs
- POJ1159---Palindrome(dp,LCS)
- 杭电1513Palindrome
- 区间dp 杭电Cheapest Palindrome
- 1513 Palindrome【lcs】
- hdoj 1513 Palindrome 【LCS】
- hdoj 1513 Palindrome 【LCS】
- HD 1513 Palindrome 【LCS】
- hdoj 1513 Palindrome(LCS)
- HDOJ-----1513Palindrome(LCS)
- 杭电1080-Lcs+DP(**有借鉴**)
- 杭电1159(Common Subsequence)LCS和dp
- 杭电1513(Palindrome)
- 【HDU 杭电 1513 Palindrome 】
- POJ 1159-Palindrome(DP/LCS变形)
- I学霸官方免费教程十七:Java面向对象之接口
- UVa 10129 Play on Words 欧拉通路
- [图论]最大流介绍 Ford-Fulkerson算法 邻接表实现
- 简单好记又完整的的配置环境变量
- getAttribute和getParameter区别
- 杭电 1513 Palindrome LCS DP
- (1)why我要学习PHP内核源码
- HDU5365Run(计算几何)详解
- Android studio两个便利的方法
- atitit. 分销系统规划p8k
- X-code插件资源下载
- Android基础:内容提供者简介
- leetcode 日经贴,python code -Word Search II
- 关于IT的一些想法