<p>You are given a string <code>s</code> containing lowercase letters and an integer <code>k</code>. You need to :</p>

<ul>
	<li>First, change some characters of <code>s</code> to other lowercase English letters.</li>
	<li>Then divide <code>s</code> into <code>k</code> non-empty disjoint substrings such that each substring is a palindrome.</li>
</ul>

<p>Return <em>the minimal number of characters that you need to change to divide the string</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;abc&quot;, k = 2
<strong>Output:</strong> 1
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;ab&quot; and &quot;c&quot;, and change 1 character in &quot;ab&quot; to make it palindrome.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aabbc&quot;, k = 3
<strong>Output:</strong> 0
<strong>Explanation:</strong>&nbsp;You can split the string into &quot;aa&quot;, &quot;bb&quot; and &quot;c&quot;, all of them are palindrome.</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;leetcode&quot;, k = 8
<strong>Output:</strong> 0
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= k &lt;= s.length &lt;= 100</code>.</li>
	<li><code>s</code> only contains lowercase English letters.</li>
</ul>

class Solution {
public:
    int dp[101][101],dp2[101][101];
    int op(string s,int st,int e){
        // if(dp2[st][e]!=-1) return dp2[st][e];
        int cnt=0,n=s.size();
        for(int i=0;i<n/2;i++){
            cnt+=(s[i]!=s[n-i-1]);
        }
        return dp2[st][e]=cnt;
    }
    int f(int ind,int k,string &s){
        if(k==0){
            return ind==s.size()?0:1e8;
        }
        if(dp[ind][k]!=-1) return dp[ind][k];
        int ans=1e8;
        for(int i=ind;i<s.size();i++){
            ans=min(ans,op(s.substr(ind,i-ind+1),ind,i)+f(i+1,k-1,s));
        }
        return dp[ind][k]=ans;
    }
    int palindromePartition(string s, int k) {
        // vector<vector<int>> dp(s.size(),vector<int>(k,-1));
        memset(dp,-1,sizeof(dp));
        memset(dp2,-1,sizeof(dp2));
        return f(0,k,s);
    }
};
30111