ProgramAlgTrain/20240919/CSP常考算法模板/背包问题_01.cpp

33 lines
716 B
C++
Raw Normal View History

2024-09-19 02:22:41 +00:00
#include <bits/stdc++.h>
using namespace std;
const int maxm = 201, maxn = 31;
int m, n;
int w[maxn], c[maxn];
int f[maxn][maxm];
/*
10 4
2 1
3 3
4 5
7 9
*/
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
cin>>m>>n; //<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>m<EFBFBD><6D><EFBFBD><EFBFBD>Ʒ<EFBFBD><C6B7><EFBFBD><EFBFBD>n
for (int i = 1; i <= n; i++) //<2F>ڳ<EFBFBD>ʼ<EFBFBD><CABC>ѭ<EFBFBD><D1AD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>֣<EFBFBD><D6A3><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ʼ<EFBFBD><CABC>
cin>>w[i]>>c[i]; //ÿ<><C3BF><EFBFBD><EFBFBD>Ʒ<EFBFBD><C6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ͼ<EFBFBD>ֵ
for (int i = 1; i <= n; i++) // f[i][v]<5D><>ʾǰi<C7B0><69><EFBFBD><EFBFBD>Ʒ<EFBFBD><C6B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>v<EFBFBD><76><EFBFBD><EFBFBD><EFBFBD>ż<EFBFBD>ֵ
for (int v = m; v > 0; v--)
if (w[i] <= v)
f[i][v] = max(f[i-1][v],f[i-1][v-w[i]]+c[i]);
else
f[i][v] = f[i-1][v];
cout<<f[n][m]<<endl; // f[n][m]Ϊ<><CEAA><EFBFBD>Ž<EFBFBD>
return 0;
}