HDU 1203（01背包）

最新推荐文章于 2020-05-27 16:10:00 发布

acmdream

最新推荐文章于 2020-05-27 16:10:00 发布

阅读量514

点赞数

分类专栏：背包问题文章标签： acm hdu 动态规划 01背包

本文链接：https://blog.csdn.net/acmdream/article/details/18317973

版权

背包问题专栏收录该内容

3 篇文章 0 订阅

订阅专栏

题意：如题。

#include <cstring>
#include <cstdio>

#define maxn 1009
#define _min(a, b) ((a) < (b) ? (a) : (b))
int cost[maxn];
double weight[maxn];
double dp[10009];

int main()
{
    int n, m, i;
    while (scanf("%d%d", &n, &m) != EOF && (n || m))
    {
        for (i = 0; i < m; ++i)
            scanf("%d%lf", cost+i, weight+i), weight[i] = 1 - weight[i];
        for (i = 0; i <= n; ++i) dp[i] = 1.0;
        int last = 0;
        for (i = 0; i < m; ++i)
            for (int j = _min(n, last+=cost[i]); j >= cost[i]; --j)
                dp[j] = _min(dp[j], dp[j-cost[i]] * weight[i]);
        printf("%.1lf%%\n", (1 - dp[n]) * 100);
    }
    return 0;
}