mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-27 13:56:26 +00:00
1268. 【例9.12】完全背包问题
http://ybt.ssoier.cn:8088/statusx.php?runidx=15593781
This commit is contained in:
parent
c7b42548d4
commit
a1193e508a
28
ybt/1268/1268.cpp
Normal file
28
ybt/1268/1268.cpp
Normal file
@ -0,0 +1,28 @@
|
||||
#include <iostream>
|
||||
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
const int N = 1005;
|
||||
|
||||
int m, n, w[N], c[N], f[N][N];
|
||||
|
||||
int main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
|
||||
cin >> m >> n;
|
||||
for (int i = 1; i <= n; i++) {
|
||||
cin >> w[i] >> c[i];
|
||||
}
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
for (int j = 0; j <= m; j++) {
|
||||
f[i][j] = std::max(f[i - 1][j], j >= w[i] ? f[i][j - w[i]] + c[i] : f[i - 1][j]);
|
||||
}
|
||||
}
|
||||
|
||||
cout << "max=" << f[n][m] << endl;
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user