Knapsack problem (Without quantity limitations)
(Mylib/Typical/knapsack_unlimited.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00
• Link: View error logs on GitHub Actions

Operations

• knapsack_unlimited(int N, Weight cap, Weight w[N], Value v[N])
  • 個数制限なしナップサック問題を解く。
  • Time complexity $O(N * cap)$

Requirements

Notes

Problems

• AOJ DPL_1_C Knapsack Problem

References

Verified with

• test/aoj/DPL_1_C/main.test.cpp

Code

#pragma once
#include <algorithm>
#include <vector>

namespace haar_lib {
  template <typename Weight, typename Value>
  Value knapsack_unlimited(int N, Weight cap, const std::vector<Weight> &w, const std::vector<Value> &v) {
    std::vector<std::vector<Value>> dp(N + 1, std::vector<Value>(cap + 1));

    for (int i = 0; i < N; ++i) {
      for (int j = 0; j <= cap; ++j) {
        if (j < w[i])
          dp[i + 1][j] = dp[i][j];
        else
          dp[i + 1][j] = std::max(dp[i][j], dp[i + 1][j - w[i]] + v[i]);
      }
    }

    return dp[N][cap];
  }
}  // namespace haar_lib

#line 2 "Mylib/Typical/knapsack_unlimited.cpp"
#include <algorithm>
#include <vector>

namespace haar_lib {
  template <typename Weight, typename Value>
  Value knapsack_unlimited(int N, Weight cap, const std::vector<Weight> &w, const std::vector<Value> &v) {
    std::vector<std::vector<Value>> dp(N + 1, std::vector<Value>(cap + 1));

    for (int i = 0; i < N; ++i) {
      for (int j = 0; j <= cap; ++j) {
        if (j < w[i])
          dp[i + 1][j] = dp[i][j];
        else
          dp[i + 1][j] = std::max(dp[i][j], dp[i + 1][j - w[i]] + v[i]);
      }
    }

    return dp[N][cap];
  }
}  // namespace haar_lib

Back to top page