fork download
copy 
  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, int k){
  33.  
  34. 	vector<vector<vector<int>>> dp(n, vector<vector<int>>(n, vector<int>(k+1, 1)));
  35.  
  36. 	for(int p=0; p<=k; p++){
  37.     	for(int gap=0; gap<n; gap++){
  38.     	    for(int i=0, j=gap; j<n; i++, j++){
  39.     	        if(gap == 0){
  40.     	            dp[i][j][p] = 1;
  41.     	        }
  42.     	        else if(gap == 1){
  43.     	            int d1 = abs(a[i] - a[j]);
  44.     	            int d = min(d1, 26-d1);
  45.  
  46.     	            if(p>=d){
  47.     	                dp[i][j][p] = 2;
  48.     	            }
  49.     	            else{
  50.     	                dp[i][j][p] = 1;
  51.     	            }
  52.  
  53.     	        }
  54.     	        else{
  55.     	            int d1 = abs(a[i] - a[j]);
  56.     	            int d = min(d1, 26-d1);
  57.  
  58.     	            dp[i][j][p] = max(dp[i+1][j][p], dp[i][j-1][p]);
  59.  
  60.     	            if(a[i] == a[j]){
  61.     	                dp[i][j][p] = max(dp[i][j][p], 2 + dp[i+1][j-1][p]);
  62.     	            }
  63.     	            else if(p-d>=0){
  64.     	                dp[i][j][p] = max(dp[i][j][p], 2 + dp[i+1][j-1][p-d]);
  65.     	            }
  66.     	        }
  67.     	    }
  68.     	}
  69.  
  70. 	}
  71.  
  72.     return dp[0][n-1][k];
  73.  
  74. }
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89.  
  90. int practice(int n, int k){
  91.  
  92.  
  93.     return 0;
  94. }
  95.  
  96.  
  97.  
  98.  
  99.  
  100. void solve() {
  101.  
  102.     cin >> a;
  103.     int n = a.size();
  104.  
  105.     int k;
  106.     cin >> k;
  107.  
  108.     cout << consistency(n, k) << endl;
  109.  
  110.  
  111. }
  112.  
  113.  
  114.  
  115.  
  116.  
  117. int32_t main() {
  118.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  119.  
  120.     int t = 1;
  121.     // cin >> t;
  122.     while (t--) {
  123.         solve();
  124.     }
  125.  
  126.     return 0;
  127. }
Success #stdin #stdout 0s 5296KB
comments (?)
stdin
copy 
aaazzz
4
stdout
copy 
6
https://ideone.com/rfEwbo
language:
C++14 (gcc 8.3)
created:
22 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!