fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. int consistency(int n){
  33.  
  34. vector<vector<int>> dp(n, vector<int>(n, 0));
  35. for(int gap=0; gap<n; gap++){
  36. for(int i=0, j=gap; j<n; i++, j++){
  37. if(gap == 0){
  38. dp[i][j] = 1;
  39. }
  40. else if(gap == 1){
  41. if(a[i] == a[j]){
  42. dp[i][j] = 2;
  43. }
  44. else dp[i][j] = 1;
  45. }
  46. else{
  47. if(a[i] == a[j]){
  48. dp[i][j] = dp[i+1][j-1] + 2;
  49. }
  50. dp[i][j] = max({dp[i][j], dp[i][j-1], dp[i+1][j]});
  51. }
  52. }
  53. }
  54. return dp[0][n-1];
  55.  
  56. }
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72. int practice(int n){
  73.  
  74.  
  75. return 0;
  76. }
  77.  
  78.  
  79.  
  80.  
  81.  
  82. void solve() {
  83.  
  84.  
  85. cin >> a;;
  86.  
  87. int n = a.size();
  88.  
  89. cout << consistency(n) << endl;
  90.  
  91.  
  92. }
  93.  
  94.  
  95.  
  96.  
  97.  
  98. int32_t main() {
  99. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  100.  
  101. int t = 1;
  102. // cin >> t;
  103. while (t--) {
  104. solve();
  105. }
  106.  
  107. return 0;
  108. }
Success #stdin #stdout 0.01s 5276KB
stdin
abcdddcab
stdout
7