hdoj 1513 Palindrome【LCS+滚动数组】
2024-10-10 07:47:30
Palindrome
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3918 Accepted Submission(s):
1340
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.
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.
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.
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.
line contains one integer, which is the desired minimal number.
Sample Input
5
Ab3bd
Sample Output
2
题意:最少向字符串中添加几个字符可以使该字符串变成回文字符串
题解:将字符串反转,跟原字符串使用LCS,算出最长公共子序列长度,拿总长度减去最长公共子序列长度就是答案
#include<stdio.h>
#include<string.h>
#define MAX 5010
#define max(x,y)(x>y?x:y)
char s1[MAX],s2[MAX];
int dp[2][MAX];
int main()
{
int i,j;
int t;
while(scanf("%d",&t)!=EOF)
{
scanf("%s",s1);
for(i=t-1,j=0;i>=0;i--)
s2[j++]=s1[i];
memset(dp,0,sizeof(dp));
for(i=1;i<=t;i++)
{
for(j=1;j<=t;j++)
{
dp[0][j]=dp[1][j];
dp[1][j]=dp[2][j];
if(s1[i-1]==s2[j-1])
dp[1][j]=dp[0][j-1]+1;
else
dp[1][j]=max(dp[1][j-1],dp[0][j]);
}
}
printf("%d\n",t-dp[1][t]);
}
return 0;
}
最新文章
- 最详细易懂的CRC-16校验原理(附源程序)(转)
- HTML 最简单的tips 怎么支持指定DIV显示提示信息
- 不安装HALCON下安装运行版U盘加密狗驱动
- 根据Request获取客户端IP 内网IP及外网IP
- 【Android】Android Studio 进行代码混淆,打包release APK
- 这些情况下onReume不应该是你的选择
- Spring实战5:基于Spring构建Web应用
- 算法基础:最大递减数问题(Golang实现)
- python实现简单表单校验框架
- Linux下chkconfig命令详解(转)
- JS列表的下拉菜单组件(仿美化控件select)
- linux(centos7)下SVN服务器如何搭建
- Java ";=="; 和 ";equals"; 和 ";"; 问题
- (NO.00001)iOS游戏SpeedBoy Lite成形记(十一)
- 在Design界面直接拖放控件的时候,提示AS- This view is not constrained vertically. At runtime it will jump to the left/(0,0) unless you
- 基于vue-cli的eslint常用设置
- Linux 安装Jdk、mysql、apache、php、tomcat、nginx
- Z-tree 统计每一父节点的叶子节点数(看这一篇就够了)
- oracle表属性
- java中的类、对象、方法