poj 1159 LCS

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
char a[10008],b[10008];
short int dp[5008][5006];
int lcs(int n)
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++){
            if(a[i-1] == b[j-1])
            {
                dp[i][j] = dp[i-1][j-1] + 1;
            }
            else
                dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
        }

    }

   return dp[n][n];
}
int main()
{
   //freopen("input.txt","r",stdin);

    int n,m;
    while(~scanf("%d",&n))
    {
        memset(dp,0,sizeof(dp));
        scanf("%s",a);

        strcpy(b,a);
        reverse(a,a+strlen(a));
       // n = a.size();
        int x = lcs(strlen(a));
        //cout<<x<<endl;
       cout<<strlen(a)- x<<endl;
    }
}