Problem Statement: Party Schedule
Explanation
This problem can be solved using 0-1 knapsack. Read this resource to learn more about 0-1 knapsack.
To find the optimal budget used, you can use backtracking. Traverse the last row and the least value of cost for which we can have the computed maximum fun is our answer for minimum cost.
Source Code
Tidak ada komentar:
Posting Komentar