POJ 1159 Palindrome
来源:互联网 发布:au3写erp源码 编辑:程序博客网 时间:2024/05/28 15:06
Palindrome
Time Limit: 3000MS Memory Limit: 65536KTotal Submissions: 45118 Accepted: 15383
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
这题转化开来实际上就是求最长公共子序列。但可恨的是我居然把求法给忘了。哎
#include <stdio.h>#include <math.h>#include <string.h>short a[5100][5100];char s1[5100],s2[5100];int main(){ int i,j,n,m,s,t; scanf("%d",&n); scanf("%s",s1); memset(a,0,sizeof(a)); for(i=0;i<=n-1;i++) { s2[n-i-1]=s1[i]; } for(i=0;i<=n-1;i++) { for(j=0;j<=n-1;j++) { if(i==0&&j==0) { if(s1[0]==s2[0]) { a[i][j]=1; } }else if(i==0&&j!=0) { if(s1[i]==s2[j]) { a[i][j]=1; }else { a[i][j]=a[i][j-1]; } }else if(i!=0&&j==0) { if(s1[i]==s2[j]) { a[i][j]=1; }else { a[i][j]=a[i-1][j]; } }else { if(s1[i]==s2[j]) { a[i][j]=a[i-1][j-1]+1; }else { if(a[i-1][j]>a[i][j-1]) { a[i][j]=a[i-1][j]; }else { a[i][j]=a[i][j-1]; } } } } } printf("%d\n",n-a[n-1][n-1]);}
- poj 1159 Palindrome LCS
- poj 1159 Palindrome LCS
- poj 1159 Palindrome
- poj 1159 Palindrome
- dp poj 1159 Palindrome
- poj 1159 Palindrome
- poj 1159 Palindrome
- POJ 1159 Palindrome DP
- Palindrome poj 1159
- Poj 1159 Palindrome
- poj 1159 Palindrome
- poj 1159 Palindrome 【DP】
- poj 1159Palindrome
- poj 1159 Palindrome
- POJ 1159 Palindrome
- POJ 1159 Palindrome
- Poj 1159 Palindrome
- POJ 1159 Palindrome
- 怎样使单元格内的文字旋转
- 修改CentOS的yum源为163
- 数据库维护
- Hibernate宏观内容
- 外贸成功销售10大秘诀!
- POJ 1159 Palindrome
- Cocos2d坐标系统
- OK6410:LED流水灯
- Binder AIDL
- 8个优秀的Android开源游戏引擎
- [AndEngine学习教程] 第1节 搭建开发环境
- ios开发ASIHTTPRequest-进度追踪
- Array Performance Comparison: C-Array vs CCArray vs NSArray vs NSMutableArray
- 随机函数项目三