0-1背包问题经典算法(二维数组实现)

最新推荐文章于 2024-09-01 12:15:17 发布

myway88

最新推荐文章于 2024-09-01 12:15:17 发布

阅读量808

点赞数

分类专栏： algorithm 文章标签：算法 fun iostream include c

本文链接：https://blog.csdn.net/myway88/article/details/4435018

版权

algorithm 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

#include "iostream"
#define CAPACITY 10
#define GOODSNUM 6

using namespace std;

void main()
{
int i=1,j;
int v[GOODSNUM] = {10,12,40,40,40,15};
int c[GOODSNUM] = {1,2,3,5,2,1};
int fun[GOODSNUM+1][CAPACITY+1];
for (i=1;i<=GOODSNUM;i++)
{
  fun[i][0] = 0;
}
for (i=1;i<=CAPACITY;i++)
{
  fun[0][i] = 0;
}
for (i=1;i<=GOODSNUM;i++)
{
  for (j=1;j<=CAPACITY;j++)
  {
   if (j<c[i-1])
   {
    fun[i][j] = fun[i-1][j];
   }
   else if (fun[i-1][j]<fun[i-1][j-c[i-1]] + v[i-1])
    {
     fun[i][j] = fun[i-1][j-c[i-1]] + v[i-1];
    }
   else
    fun[i][j] = fun[i-1][j];
  }
}
cout<<"The max value is: "<<fun[GOODSNUM][CAPACITY]<<endl;
}