<p>There is a strange printer with the following two special properties:</p>

<ul>
	<li>The printer can only print a sequence of <strong>the same character</strong> each time.</li>
	<li>At each turn, the printer can print new characters starting from and ending at any place and will cover the original existing characters.</li>
</ul>

<p>Given a string <code>s</code>, return <em>the minimum number of turns the printer needed to print it</em>.</p>

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

<pre>
<strong>Input:</strong> s = &quot;aaabbb&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;bbb&quot;.
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;aba&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> Print &quot;aaa&quot; first and then print &quot;b&quot; from the second place of the string, which will cover the existing character &#39;a&#39;.
</pre>

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 100</code></li>
	<li><code>s</code> consists of lowercase English letters.</li>
</ul>

class Solution {
public:
    int strangePrinter(string s) {
        int n = s.length();
        int dp[n][n];
        memset(dp,0,sizeof(dp));
        for(int i=0;i<n;i++){
            dp[i][i]=1;
        }
        for(int j=1;j<n;j++){
            for(int i=0;i+j<n;i++){
                int st = i;
                int en = i+j;
                dp[st][en] = (dp[st+1][en]+1);
                vector<int> ind;
                for(int x=st;x<=en;x++){
                    if(s[x]==s[st]){
                        ind.push_back(x);
                    }
                }
                int score = 1e9;
                // int pref_score = 0;
                for(int x=1;x<ind.size();x++){
                    int score1 = dp[st][ind[x]-1];
                    int score2 = 0;
                    if(ind[x]!=en) score2 = dp[ind[x]+1][en];
                    dp[st][en] = min(dp[st][en],score1+score2);
                    // score
                }
                if(s[st]==s[en]) dp[st][en] = min(dp[st][en],dp[st+1][en-1]+1);
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                cout<<dp[i][j]<<" ";
            }
            cout<<endl;
        }
        // cout<<endl;
        return dp[0][n-1];
        
    }
};
35592