POJ 1159 Palindrome 解题报告

 

Palindrome

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 36591		Accepted: 12355

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

2

Source

IOI 2000

思路：标准的dp；

要点：暴力递归的话会超时；开空间使用int会超内存（使用short即可）；

注释：dp[i][j],从str的第i个到第j个需要添加的最小个数。代码也比较暴力，有点丑！

• Source Code

  #include<iostream>
  #include<cstring>
  using namespace std;
  
  int N = 0;
  char str[5002];
  short dp[5002][5002];
  
  int min( int x, int y ){
  	if( x<y ) return x;
  	else return y;
  }
  
  int main(){
  	cin >> N;
  	int i, j;
  	for(i=1; i<=N;i++){
  		cin >> str[i];
  	}
  	for( j=2; j<=N; j++){
  		for( i=j-1; i>=1; i--){
  			if( str[i]==str[j] ){
  				dp[i][j]=dp[i+1][j-1];
  			}
  			else{
  				dp[i][j]=1+min(dp[i+1][j], dp[i][j-1]);
  			}
  		}
  	}
  	cout << dp[1][N] << endl;
  	return 0;
  }