[PTA] L2-008 最长对称子串（区间dp

 

#include<iostream>
#include<cstring>


using namespace std;
const int N=1010;

string a;

int dp[N][N];

int main(){
    getline(cin,a);
    int n=a.size();

    a="%"+a;

    int res=1;
    for(int l=1;l<=n;l++){
        for(int i=1;i+l-1<=n;i++){
            int j=i+l-1;
            if(l==1){
                dp[i][j]=1;
                continue;
            }
            if(a[i]==a[j] && dp[i+1][j-1]==l-2){
                dp[i][j] = dp[i + 1][j - 1] + 2;
                res = max(res, dp[i][j]);
            }
        }
    }
    cout<<res<<endl;
    return 0;
}