C - Fewest Flops

这个题的意思是：
“aabbbaabaaaa” may be encoded as “2a3b2a1b4a”
给出一个字符串，将其按照每组k个字符切开，将每组的字符重新排序，
let S be “uuvuwwuv” and k be 4. Then S1 is “uuvu” and has three chunks, but may
be rearranged to “uuuv” which has two chunks. Similarly, S2 may be rearranged to “vuww”. Then S
or S1S2, is “uuuvvuww” which is 4 chunks, indeed the minimum number of chunks.

本来很简单的一个题做了半天。。
无奈。。
dp[i][j]记录第i/k组以j结尾的块数。

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
#define MAXN 1005
#define INF 0x3f3f3f3f
int dp[MAXN][MAXN],a[MAXN][MAXN],ch[MAXN];//第i组以j结尾之前 所有chunks个数 

int main(){
    int t;
    string s;
    cin>>t;
    while(t--){
        int k;
        cin>>k>>s;
        memset(dp,INF,sizeof(dp));
        memset(ch,0,sizeof(ch));
        memset(a,0,sizeof(a));
        for(int i=0;i<s.length();i+=k){
            for(int j=0;j<k;j++){
                int t=s[i+j]-'a';
                if(a[i][t]==0) ch[i]++;
                a[i][t]++;
            }
        }
        for(int i=0;i<26;i++){
            if(a[0][i]) dp[0][i]=ch[0];
        }
        int ans=INF;
        if(s.length()==k){
            cout<<ch[0]<<endl;
            continue;
        }
        for(int i=k;i<s.length();i+=k){
            for(int j=0;j<26;j++){
                //cout<<a[i][j]<<" ";
                if(!a[i][j]) continue;
                for(int p=0;p<26;p++){
                    if(a[i][p] && a[i-k][p] && (p!=j||ch[i]==1))
                        dp[i][j]=min(dp[i][j],dp[i-k][p]+ch[i]-1);
                    else dp[i][j]=min(dp[i][j],dp[i-k][p]+ch[i]);
                    if(i==s.length()-k) ans=min(ans,dp[i][j]); 
            //  cout<<dp[i][j]<<" ";
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}