poj 1159 Palindrome

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;short dp[5001][5001];char a[500010];int main(){int n,m,i,j,k;while(scanf("%d",&n)!=EOF){getchar();gets(a);memset(dp,0,sizeof(dp));for(i=n-2;i>=0;i--){for(j=i+1;j<n;j++){if(a[i]==a[j])dp[i][j]=dp[i+1][j-1];elsedp[i][j]=min(dp[i+1][j],dp[i][j-1])+1;}}printf("%d\n",dp[0][n-1]);}return 0;}