【DP】poj 1159_Palindrome_201408041527

最新推荐文章于 2020-03-17 09:09:10 发布

龙腾四海365

最新推荐文章于 2020-03-17 09:09:10 发布

阅读量508

点赞数

文章标签： dp poj 滚动数组

本文链接：https://blog.csdn.net/u011637069/article/details/38370685

版权

poj 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Palindrome

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 52497		Accepted: 18097

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.

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

5
Ab3bd

Sample Output

Source

IOI 2000

题意：给你一个字符串，问至少添加几个字符能变成一个回文字符串

解题思路：

把字符串翻转过来，求两个字符串的最长公共子序列（LCS）

难点：求LCS

重点：给的内存是65536k，如果开一个int[5050][5050]肯定要超内存的，这时候怎么办，动态数组便出现。。。

详见代码：

#include <stdio.h>
#include <string.h>

char str[5050],str2[5050];
int ans[2][5050];

int max(int a,int b)
{
    return a > b ? a : b ;
}
int main()
{
    int i,j,n;
    memset(ans,0,sizeof(ans));
    memset(str,0,sizeof(str));
    memset(str2,0,sizeof(str2));
    scanf("%d",&n);
    scanf("%s",str);
    for(j=0,i=n-1;i>=0;i--)
    str2[j++]=str[i];
    //puts(str);
    //puts(str2);
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(str[i]==str2[j])
            ans[(i+1)%2][j+1]=ans[i%2][j]+1;//动态数组 
            else
            ans[(i+1)%2][j+1]=max(ans[i%2][j+1],ans[(i+1)%2][j]);//动态数组 
        }
    }
    printf("%d\n",n-ans[n%2][n]);
    //system("pause");
    return 0;
}