当前位置:网站首页>背包问题 AcWing 9. 分组背包问题
背包问题 AcWing 9. 分组背包问题
2022-07-05 06:16:00 【T_Y_F666】
背包问题 AcWing 9. 分组背包问题
原题链接
算法标签
背包问题 DP
思路
代码
#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 105;
int s[N];
int v[N][N], w[N][N],f[N];
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
void put(int x) {
if(x<0) putchar('-'),x=-x;
if(x>=10) put(x/10);
putchar(x%10^48);
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n=read(), vv=read();
rep(i, 1, n+1){
s[i]=read();
rep(j, 0, s[i]){
v[i][j]=read(), w[i][j]=read();
}
}
// n组物品
rep(i, 1, n+1){
// 背包剩余容量 由于物品只能使用一次 因此从大到小循环
Rep(j, vv, 0){
// 第i组中选取一个物品使价值最大
rep(k, 0, s[i]){
if(v[i][k]<=j){
f[j]=max(f[j], f[j-v[i][k]]+w[i][k]);
}
}
}
}
printf("%lld", f[vv]);
return 0;
}
原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈
边栏推荐
- Leetcode dynamic programming
- A reason that is easy to be ignored when the printer is offline
- 1041 Be Unique
- 快速使用Amazon MemoryDB并构建你专属的Redis内存数据库
- 【Rust 笔记】17-并发(上)
- Daily question 1984 Minimum difference in student scores
- Binary search template
- Leetcode-9: palindromes
- [rust notes] 17 concurrent (Part 2)
- JS quickly converts JSON data into URL parameters
猜你喜欢
Navicat連接Oracle數據庫報錯ORA-28547或ORA-03135
LVS简介【暂未完成(半成品)】
什么是套接字?Socket基本介绍
Sqlmap tutorial (1)
LeetCode 0107. Sequence traversal of binary tree II - another method
MySQL advanced part 2: optimizing SQL steps
2021apmcm post game Summary - edge detection
QQ电脑版取消转义符输入表情
Open source storage is so popular, why do we insist on self-development?
Error ora-28547 or ora-03135 when Navicat connects to Oracle Database
随机推荐
MySQL advanced part 2: MySQL architecture
js快速将json数据转换为url参数
leetcode-1200:最小绝对差
多屏电脑截屏会把多屏连着截下来,而不是只截当前屏
1.13 - RISC/CISC
1.15 - input and output system
2021apmcm post game Summary - edge detection
Currently clicked button and current mouse coordinates in QT judgment interface
MIT-6874-Deep Learning in the Life Sciences Week 7
QQ computer version cancels escape character input expression
Leetcode-31: next spread
Flutter Web 硬件键盘监听
Data visualization chart summary (II)
【Rust 笔记】14-集合(下)
In depth analysis of for (VaR I = 0; I < 5; i++) {settimeout (() => console.log (I), 1000)}
leetcode-22:括号生成
MySQL怎么运行的系列(八)14张图说明白MySQL事务原子性和undo日志原理
1040 Longest Symmetric String
MySQL advanced part 1: stored procedures and functions
快速使用Amazon MemoryDB并构建你专属的Redis内存数据库