baoshuo/OI-codes
baoshuo/OI-codes
0
1
Fork 0
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-08 15:38:47 +00:00
Code Releases Activity

P1048 [NOIP2005 普及组] 采药

Browse Source 
R67361911
This commit is contained in:
Baoshuo Ren 2022-01-21 11:27:51 +08:00
parent 1b0edafd84
commit a076967f79
Signed by: baoshuo
GPG Key ID: 70F90A673FB1AB68
1 changed files with 11 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
Luogu/P1048/P1048.cpp
View File

@ -1,21 +1,24 @@
#include <bits/stdc++.h> #include <iostream>
using namespace std; using std::cin;
using std::cout;
using std::endl;
int t, m, v[105], w[105], f[105][105];
int main() { int main() {
int t, m, w[1005], v[1005], dp[1005][1005];
cin >> t >> m; cin >> t >> m;
for (int i = 1; i <= m; i++) { for (int i = 1; i <= m; i++) {
cin >> w[i] >> v[i]; cin >> v[i] >> w[i];
} }
for (int i = 1; i <= m; i++) { for (int i = 1; i <= m; i++) {
for (int j = t; j >= 0; j--) { for (int j = t; j >= 0; j--) {
dp[i][j] = dp[i - 1][j]; f[i][j] = f[i - 1][j];
if (j >= w[i]) { if (j >= v[i]) {
dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i]] + v[i]); f[i][j] = std::max(f[i][j], f[i - 1][j - v[i]] + w[i]);
} }
} }
} }
cout << dp[m][t] << endl; cout << f[m][t] << endl;
return 0; return 0;
} }