hdu 5410 CRB and His Birthday 01完全混合背包

题意：m块钱n个物品，第i个物品需要买了k个需要k*w【i】块钱，得到A【i】*k+B【i】个糖果，问最多能得到多少糖果

将第i个物品拆成两份，花费都为w【i】，第一份价值为A【i】+B【i】，只能取一次，第二份为A【i】，可以去无限次，跑下混合背包即可

#include <bits/stdc++.h>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <time.h>
#include <vector>
#include <cstdio>
#include <string>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define Mp(a, b) make_pair(a, b)
#define asd puts("asdasdasdasdasdf");
typedef long long ll;
typedef pair <int, int> pl;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;
const int N = 1010;

int dp[N<<1];
int A[N<<1], B[N<<1];
int w[N<<1];
int v[N<<1];

int main()
{
    int tot;
    scanf("%d", &tot);
    while( tot-- ) {
        int n, m;
        scanf("%d%d", &m, &n);
        for( int i = 1; i <= n; ++i ) {
            scanf("%d%d%d", &w[i], &A[i], &B[i]);
            v[i] = A[i]+B[i];
            v[i+n] = A[i];
            w[i+n] = w[i];
        }
        memset( dp, 0, sizeof( dp ) );
        for( int i = 1; i <= n*2; ++i ) {
            if( i <= n ) {
                for( int j = m; j >= w[i]; --j ) {
                    dp[j] = max( dp[j], dp[j-w[i]] + v[i] );
                }
            }
            else {
                for( int j = w[i]; j <= m; ++j ) {
                    dp[j] = max( dp[j], dp[j-w[i]] + v[i] );
                }
            }
        }
        printf("%d\n", dp[m]);
    }
    return 0;
}