동적 계획에 최소 문자를 추가하여 문자열을 리셋 POJ 1159 short 통과!

Palindrome
Time Limit:3000MS
Memory Limit:65536K
Total Submissions:33120
Accepted:11122
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

#include<stdio.h>
#define MAX 5001
short opt[MAX][MAX]={0};//opt[i][j]  i,j                
//     int   ，           short ，    ，  4000 K  ，             
int main()
{
    //freopen("input","r",stdin);
    int str_len;
    int i,j;
    char str[MAX];
    scanf("%d",&str_len);
    scanf("%s",str);
    for(i=str_len;i>0;i--)//       ，    opt     ，       1，    opt[i-1][j-1],      
        for(j=i;j<=str_len;j++)
        {
                if(str[i]==str[j]) opt[i][j]=opt[i+1][j-1];//           for     
                else if(opt[i+1][j]>opt[i][j-1]) opt[i][j]=opt[i][j-1]+1;
                else opt[i][j]=opt[i+1][j]+1;

        }
        //printf("%d %d",_i,_j);
    printf("%d",opt[1][str_len]);
}