dp[i][i+j] = max{dp[i][k]+dp[k+1][i+j], dp[i-1][i+j-1]+(s[i]<->s[i+j]是否匹配)} | k:i...i+j-1;