hdu 5677 ztr loves substring

暴力字符串统计，然后多重背包即可，可以二进制优化。

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <set>
#include <map>
#include <vector>
#include <iostream>
#include <queue>
#define LL long long
#define pii pair <int, int>
#define piii pair <int, pii>
#define xx first
#define yy second
#define ls rt << 1
#define rs rt << 1 | 1
#define lson ls, l, m
#define rson rs, m + 1, r
#define pdi pair <double, int>
using namespace std;

const int N = 110;
char s[N];
int c[N], dp[2][N][N];

int main () {
//    freopen ("in.txt", "r", stdin);
    int T;
    cin >> T;
    while (T--) {
        int n, k, l;
        cin >> n >> k >> l;
        memset (c, 0, sizeof c);
        for (int i = 1; i <= n; i++) {
            scanf ("%s", s);
            int len = strlen (s);
            for (int j = 0; j < len; j++) {
                int l = j, r = j, now = -1;
//                c[1]++;
                while (l >= 0 && r < len && s[l] == s[r]) {
                    now += 2;
                    c[now]++;
                    l--, r++;
                }
//                cout << l + 1 << ' ' << r - 1 << endl;
            }
            for (int j = 0; j + 1 < len; j++) {
                int l = j, r = j + 1, now = 0;
                while (l >= 0 && r < len && s[l] == s[r]) {
                    now += 2;
                    c[now]++;
                    l--, r++;
                }
//                cout << l + 1 << ' ' << r - 1 << endl;
            }
        }
//        for (int i = 1; i <= l; i++) cout << c[i] << ' '; cout << endl;
        memset (dp, 0, sizeof dp);
        int now = 0;
        dp[0][0][0] = 1;
        for (int i = 0; i < l; i++) {
            memset (dp[now ^ 1], 0, sizeof dp[now ^ 1]);
            for (int j = 0; j <= k; j++) {
                for (int K = 0; K <= l; K++) if (dp[now][j][K]) {
                    for (int L = 0; L <= c[i + 1] && j + L <= k && K + L * (i + 1) <= l; L++) {
                        dp[now ^ 1][j + L][K + L * (i + 1)] = 1;
                    }
                }
            }
            now ^= 1;
        }
        cout << (dp[now][k][l] ? "True\n" : "False\n");
    }
}

//二进制优化多重背包 
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define mem(a, b) memset(a, b, sizeof(a))
typedef long long ll;
const int maxn=1001000;
int dp[111][110];//长度,用了几个
int a[maxn],time1[110],b[maxn],c[maxn];
char s[1010];

bool check(int x,int y){
    for(int i=x,j=y;i<j;i++,j--)
        if(s[i]!=s[j])
            return false;
    return true;
}

int main(){
    int _,n,m,L;
    scanf("%d",&_);
    while(_--){
        scanf("%d%d%d",&n,&m,&L);
        int len=0,cnt=0;
        mem0(time1);
        for(int i=1;i<=n;i++){
            scanf("%s",s);
            int len=strlen(s);
            for(int j=0;j<len;j++)
                for(int k=j;k<len;k++)
                    if(check(j,k))
                        a[cnt++]=k-j+1,time1[k-j+1]++;
        }
        sort(a,a+cnt);
        cnt=unique(a,a+cnt)-a;
        int cnt1=0;
        for(int i=0;i<cnt;i++){
            int count=1;
            while(time1[a[i]]>count){
                b[cnt1]=a[i]*count,c[cnt1++]=count;
                time1[a[i]]-=count;
                count*=2;
            }
            if(time1[a[i]]!=0)
                b[cnt1]=a[i]*time1[a[i]],c[cnt1++]=time1[a[i]];
        }
        mem0(dp);
        dp[0][0]=1;
        for(int i=0;i<cnt1;i++)
            for(int j=L;j>=b[i];j--)
                for(int z=m;z>=c[i];z--)
                    dp[j][z]|=dp[j-b[i]][z-c[i]];
        if(dp[L][m]==1)
            printf("True\n");
        else
            printf("False\n");
    }
    return 0;
}