牛客網廣工大 DP 最長迴文子串 D題

牛客網

//#include <bits/stdc++.h>
#include<stdio.h>
#include<string.h>
#include<string>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<stdlib.h>
#include<time.h>
#include <iomanip>
#define lowbit(x) (x&(-x))
#define inf  0x7fffffff
#define linf 0x7fffffffffffffff
#define fil(x,y) memset(x,y,sizeof(x))
#define fup(i,x,y) for(int i=(x);i<=(y);i++)
#define fdn(i,x,y) for(int i=(x);i>=(y);i--)
#define sp(x) setprecision(x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define sld(n) scanf("%lld",&n)
#define sldd(n,m) scanf("%lld%lld",&n,&m)
#define slddd(n,m,k) scanf("%lld%lld%lld",&n,&m,&k)
#define sf(n) scanf("%lf",&n)
#define sff(n,m) scanf("%lf%lf",&n,&m)
#define sfff(n,m,k) scanf("%lf%lf%lf",&n,&m,&k)
#define sc(n) scanf("%s",n)
#define pf(x) printf("%d\n",x)
#define pfl(x) printf("%lld\n",x)
#define pff(x) printf("%lf\n",x)
#define debug printf("!!\n");
#define N 1000005
#define M 4000009
#define pi acos(-1)
#define eps 1e-2
//cout.setf(ios::fixed);
//freopen("out.txt","w",stdout);// freopen("in.txt","r",stdin);
using namespace std;
typedef long long  ll;
typedef double db;
int dp[2005][2005];
void solve()
{
    char c[2005];
    while(~sc(c+1))
    {
        fil(dp,0);
        int len=strlen(c)-1;
  //      pf(len);
        fup(i,1,len)
        {
            if(c[i]>='a'&&c[i]<='z') c[i]-='a'-'A';
            dp[i][i]=1;
        }
        fup(i,1,len)
        for(int j=1; j+i<=len; j++)
            if(c[j]==c[j+i]) dp[j][j+i]=dp[j+1][j+i-1]+2;
            else dp[j][j+i]=max(dp[j+1][j+i],dp[j][j+i-1]);
        pf(len-dp[1][len]);
    }
}
int main()
{
    int t=1;
//    sd(t);
    while(t--)
    {
        solve();
    }
    return 0;
}