hdu5410 CRB and Birthday(背包)

最新推荐文章于 2017-11-23 09:05:38 发布

KIJamesQi

最新推荐文章于 2017-11-23 09:05:38 发布

阅读量303

点赞数

分类专栏： DP-背包文章标签：背包

本文链接：https://blog.csdn.net/KIJamesQi/article/details/51946372

版权

DP-背包专栏收录该内容

7 篇文章 1 订阅

订阅专栏

该博客探讨了一道涉及背包问题的题目——hdu5410，作者指出利用二进制优化的方法可以解决这个问题。对于不熟悉二进制优化的读者，作者建议阅读《背包九讲》以获取更多知识。

摘要由CSDN通过智能技术生成

这题就是背包，二进制优化下就好了。
不懂二进制优化的就看看背包九讲

/*****************************************
Author      :Crazy_AC(JamesQi)
Time        :2016
File Name   :
*****************************************/
// #pragma comment(linker, "/STACK:1024000000,1024000000")
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <sstream>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <climits>
using namespace std;
#define MEM(x,y) memset(x, y,sizeof x)
#define pk push_back
#define lson rt << 1
#define rson rt << 1 | 1
#define bug cout << "BUG HERE\n"
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
const double eps = 1e-8;
const double pi = 4 * atan(1);
const int inf = 1 << 30;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int nCase = 0;
int dcmp(double x){//精度正负、0的判断
    if (fabs(x) < eps) return 0;
    return x < 0?-1:1;
}
inline int read(){
    char c = getchar();
    while (!isdigit(c)) c = getchar();
    int x = 0;
    while (isdigit(c)) {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}
const int maxn = 1010;
int dp[2010];
int val[40200];
int cost[40200];
int n, m;
int main(int argc, const char * argv[])
{    
    // freopen("in.txt","r",stdin);
    // freopen("out.txt","w",stdout);
    // clock_t _ = clock();

    int kase;cin >> kase;
    while(kase--) {
        cin >> m >> n;
        int w, a, b;
        int top = 0;
        for (int i = 1;i <= n;++i) {
            scanf("%d%d%d", &w, &a, &b);
            cost[++top] = w;
            val[top] = a + b;
            int k = m - w;
            int o = 1;
            while(k >= o) {
                val[++top] = o*a;
                cost[top] = w*o;
                k-=o;
                o *= 2;
            }
            if (k > 0) {
                val[++top] = k*a;
                cost[top] = k*w;
            }
        }
        memset(dp, 0,sizeof dp);
        for (int i = 1;i <= top;++i) {
            for (int j = m;j >= cost[i];--j)
                dp[j] = max(dp[j], dp[j-cost[i]] + val[i]);
        }
        cout << dp[m] << endl;
    }

    // printf("\nTime cost: %.2fs\n", 1.0 * (clock() - _) / CLOCKS_PER_SEC);
    return 0;
}