qq_39921637的博客

void zeroone(int w, int v) { for(int i = m; i >= w; i--) dp[i] = max(dp[i], dp[i-w]+v); } void comdp(int w, int v) { for(int i = w; i <= m; i++) dp[i] = max(dp[i], dp[i-w...

#pragma GCC optimize(2) #include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 105; int Case = 1, n, m; int dp[maxn][maxn], cnt[maxn], w[maxn], res; vector<int&gt...