小魚兒

1068 Find More Coins (30 分) Eva loves to collect coins from all over the universe, including some other planets like Mars. One day she visited a universal shopping mall which could accept all kinds o...

#include <cstdio> //完全背包问题——物品件数无穷型 for(int i=1;i<=n;++i) { for(int v=w[i];v<=V;++v) { //有两种选择，选第i件物品，不选第i件物品 dp[i][v]=max(dp[i-1][v],dp[i][v-w[i]]+c[i]); //与01背包唯一区别是第二个参数是dp[i]...

#include <cstdio> #include <algorithm> using namespace std; const int maxn =100; //物品最大件数 const int maxv=1000;//V的上限 int w[maxn],c[maxn],dp[maxv]; int main() { int n,V; scanf("%d%d",&...

#include <cstdio> //01背包问题 for(int i=1;i<=n;++i) { for(int v=w[i];v<=V;++v) { //有两种选择，选第i件物品，不选第i件物品 dp[i][v]=max(dp[i-1][v],dp[i-1][v-w[i]]+c[i]); } } //利用滚动数组进行空间优化 for(int i=...