今天先做题,分析明天在来了(dog)
#include<stdio.h>
#include<iostream>
using namespace std;
const int N = 1010;
int f[N][N];
int v[N],w[N];
int n , m;//n是总数量,m是总体积
int main()
{
scanf("%d %d",&n,&m);
for(int i = 1;i<=n;i++){
scanf("%d %d",&v[i],&w[i]);
}
for(int i = 1;i<=n; i++ ){
for(int j = 0;j<=m; j++ ){//考虑每个情况是否合法
f[i][j] = f [i-1][j];//左半边,也就是不选第i个数
if(j >= v[i]) f[i][j] = max(f[i-1][j],f[i-1][j-v[i]]+w[i]);//当j>v[i]时右半边才存在;
}
}
printf("%d",f[n][m]);
return 0;
}
#include<stdio.h>
#include<iostream>
using namespace std;
const int N = 1010;
int f[N][N];
int v[N],w[N];
int n , m;//n是总数量,m是总体积
int main()
{
scanf("%d %d",&n,&m);
for(int i = 1;i<=n;i++){
scanf("%d %d",&v[i],&w[i]);
}
for(int i = 1;i<=n;i++){
for(int j = 0;j<=m;j++){
f[i][j]=f[i-1][j];
if(j>=v[i])f[i][j]=max(f[i-1][j],f[i][j-v[i]]+w[i]);
}
}
printf("%d",f[n][m]);
return 0;
}
还有几个多重问题,但还是有点模糊,明天再干
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N=1e5+100;
ll v[N],w[N];
ll f[N];
int main()
{
ll n,m;
ll cnt=1;
cin>>n>>m;
ll a,b,c;
for(ll i=1;i<=n;i++)
{
cin>>a>>b>>c;
for(ll j=1;j<=c;j++)
{
v[cnt]=a;
w[cnt]=b;
cnt++;
}//将多重背包一个一个拆出来
}
for(ll i=1;i<=cnt;i++)
{
for(ll j=m;j>=v[i];j--)
{
f[j]=max(f[j],f[j-v[i]]+w[i]);
}
}//01背包
cout<<f[m];
return 0;
}
#include <iostream>
using namespace std;
const int N = 12010, M = 2010;
int n,m;
int v[N],w[N];
int f[N];
int main()
{
scanf("%d %d",&n,&m);
int cnt = 0;
while(n--){
int a, b, s;
scanf("%d %d %d",&a,&b,&s);
if (s == 0)s = m/a;
else if(s == -1) s = 1;
int k = 1;//个数
while(k <= s){
v[++cnt] = a * k;
w[cnt] = b * k;
s -= k;
k *= 2;
}
if(s > 0){
cnt ++;
v[cnt] = a * s;
w[cnt] = b * s;
}
}
n = cnt;
for(int i = 1; i <= n; i ++){
for(int j = m; j >= v[i]; j --){
f[j] = max(f[j],f[j - v[i]] + w[i]);
}
}
printf("%d\n",f[m]);
return 0;
}