救命!help!
查看原帖
救命!help!
424241
liujiafang楼主2022/11/27 20:07
#include <iostream>
#include <cstring>
using namespace std;
int v[105],w[105],m[105],dp[10000005];
int main()
{
    ios::sync_with_stdio(false);
    int n,W;
    cin >> n >> W;
    for (int i = 1;i <= n;i++) cin >> v[i] >> w[i] >> m[i];
    memset(dp,0,sizeof(dp));
    dp[0] = 1;
    for (int i = 1;i <= n;i++)
        for (int j = 1;j <= m[i];j++)   
            for (int k = W;k >= v[i];k--)
                dp[k] = max(dp[k],dp[k-v[i]]+w[i]);
    int ans = 0;
    for (int i = 0;i <= W;i++) ans = max(ans,dp[i]);
    cout << ans << endl;
    return 0;
}

0分,求指教

2022/11/27 20:07
加载中...