poj 1159 Palindrome(dp)

题目：http://poj.org/problem?id=1159

 #include<iostream>
 #include<cstring>
 #include<cstdio>
 using namespace std;

 int mmin(int a,int b)
 {
     return a>b?b:a;
 }
 short int d[][];
 int main()
 {
     int n,i,j;
     char s[];
     memset(d,,sizeof(d));
     cin>>n;
     for(i=; i<=n; i++)
     cin>>s[i];
     for(i=n; i>=; i--)
     for(j=i+; j<=n; j++)
     if(s[i]==s[j])
     d[i][j]=d[i+][j-];
     else
     d[i][j]=mmin(d[i+][j],d[i][j-])+;

     cout<<d[][n]<<endl;
     return ;
 }