题解 | #最长回文子串#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    string s;cin>>s;
    vector<vector<int>> dp(s.size(),vector<int>(s.size(),1));
    int Max = 1;
    for(int i = s.size()-1;i>=0;i--){
        for(int j = i+1;j<s.size();j++){
            dp[i][j] = (s[i]==s[j]) && dp[i+1][j-1];
            if(dp[i][j])
                Max = max(Max,j-i+1);
        }
    }
    cout<<Max;
}