pku1159 Palindrome(简单dp)

这是一道简单dp,状态方程if（ch[i]==ch[j]）min[i][j]=min[i+1][j-1]
    else min[i][j]=min{min[i+1][j],min[i][j+1]}+1

/*pku1159
  Name: Palindrome
  Date: 25-07-08 19:20
  Description: 回文，字符串是对称的 
*/
#include<iostream>
using namespace std;
#include<stdio.h>
#include<algorithm>
#define pr printf
short a[5006][5006];
char ch[5006];
int main(){
    int e,i,j,k;
    int n;
    scanf("%d%s",&n,ch);
    memset(a,0,sizeof(a));
    a[0][0]=0;
        for(j=1;j<n;j++){
            for(i=j-1;i>=0;i--){
             if(ch[j]==ch[i]){
                a[i][j]=a[i+1][j-1];
            }
            else {
                    a[i][j]=a[i][j-1]+1;
                    if(a[i][j]>a[i+1][j]+1)a[i][j]=a[i+1][j]+1; 
                    //状态转移               
                  }
                }
            }
        pr("%d/n",a[0][n-1]);
}
/*
5
Ab3bd
*/