分组背包和多重背包

最新推荐文章于 2024-11-06 11:05:01 发布

yemu0309

最新推荐文章于 2024-11-06 11:05:01 发布

阅读量85

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/weixin_73070122/article/details/129162295

版权

分组背包

#include <iostream>

using namespace std;

const int N = 110;

int n, m;
int f[N][N];
int s[N], v[N][N], w[N][N];

int main()
{
   cin >> n >> m;

   for (int i = 1; i <= n; i ++ )
   {
       cin >> s[i];
       for (int j = 1; j <= s[i]; j ++ )
           cin >> v[i][j] >> w[i][j];
   }

   for (int i = 1; i <= n; i ++ )
       for (int j = 1; j <= m; j ++ )
       {
           f[i][j] = f[i - 1][j];
           for (int k = 1; k <= s[i]; k ++ )
               if (v[i][k] <= j)
                   f[i][j] = max(f[i - 1][j - v[i][k]] + w[i][k], f[i][j]);
       }

   cout << f[n][m] << endl;

   return 0;
}

多重背包

#include <iostream>

using namespace std;

const int N = 8 * 100, M = 1e4;

int n, m;
int f[N][M];
int v[N], w[N];

int main()
{
   cin >> n >> m;

   int cnt = 0;
   for (int i = 1; i <= n; i ++ )
   {
       int a, b, s;
       cin >> a >> b >> s;
       int k = 0;

       while (s > k)
       {
           if (k == 0) k ++ ;
           cnt ++ ;
           v[cnt] = k * a;
           w[cnt] = k * b;
           s -= k;
           k *= 2;
       }

       if (s)
       {
           cnt ++ ;
           v[cnt] = s * a;
           w[cnt] = s * b;
       }
   }

   n = cnt;
   for (int i = 1; i <= n; i ++ )
       for (int j = 1; j <= m; j ++ )
       {
           f[i][j] = f[i - 1][j];
           if (j >= v[i]) f[i][j] = max(f[i][j], f[i - 1][j - v[i]] + w[i]);
       }

   cout << f[n][m] << endl;

   return 0;
}