P1216 [USACO1.5][IOI1994]数字三角形 Number Triangles
#include <bits/stdc++.h>
using namespace std;
int r, a[1005][1005], ans;
int main()
{
cin >> r;
for(int i = 1; i <= r; i++)
for(int j = 1; j <= i; j++)
cin >> a[i][j];
for(int i = 2; i <= r; i++){
for(int j = 1; j <= i; j++){
a[i][j] += max(a[i - 1][j - 1], a[i - 1][j]);
ans = max(ans, a[i][j]);
}
}
cout << ans << endl;
return 0;
}
P1048 [NOIP2005 普及组] 采药
#include <bits/stdc++.h>
using namespace std;
int T, M, t[105], m[105], dp[105][1005];
int main()
{
cin >> T >> M;
for(int i = 1; i <= M; i++) cin >> t[i] >> m[i];
for(int i = 1; i <= M; i++){
for(int j = T; j >= 0; j--){
if(t[i] <= j)dp[i][j] = max(dp[i - 1][j - t[i]] + m[i], dp[i - 1][j]);//选第i种或不选
else dp[i][j] = dp[i - 1][j];
}
}
cout << dp[M][T] << endl;
return 0;
}
滚动数组:一维dp
#include <bits/stdc++.h>
using namespace std;
int T, M, t[105], m[105], dp[1005];
int main()
{
cin >> T >> M;
for(int i = 1; i <= M; i++) cin >> t[i] >> m[i];
for(int i = 1; i <= M; i++){
for(int j = T; j >= 0; j--){
if(j >= t[i])
dp[j] = max(dp[j - t[i]] + m[i], dp[j]);//选第i种或不选
//else dp[j] = dp[j];
}
}
cout << dp[T] << endl;
return 0;
}
P1616 疯狂的采药
与上一题不同:(上0-1背包,此完全背包)
1. 每种草药可以无限制地疯狂采摘。
2. 药的种类眼花缭乱,采药时间好长好长啊!师傅等得菊花都谢了!long long
首先dp数组初始化全为0:给定物品种类有4种,包最大体积为5,数据来源于题目的输入
v[1] = 1, w[1] = 2
v[2] = 2, w[2] = 4
v[3] = 3, w[3] = 4
v[4] = 4, w[4] = 5
i = 1 时: j从v[1]到5
dp[1] = max(dp[1],dp[0]+w[1]) = w[1] = 2 (用了一件物品1)
dp[2] = max(dp[2],dp[1]+w[1]) = w[1] + w[1] = 4(用了两件物品1)
dp[3] = max(dp[3],dp[2]+w[1]) = w[1] + w[1] + w[1] = 6(用了三件物品1)
dp[4] = max(dp[4],dp[3]+w[1]) = w[1] + w[1] + w[1] + w[1] = 8(用了四件物品1)
dp[5] = max(dp[3],dp[2]+w[1]) = w[1] + w[1] + w[1] + w[1] + w[1] = 10(用了五件物品)
i = 2 时:j从v[2]到5
dp[2] = max(dp[2],dp[0]+w[2]) = w[1] + w[1] = w[2] = 4(用了两件物品1或者一件物品2)
dp[3] = max(dp[3],dp[1]+w[2]) = 3 * w[1] = w[1] + w[2] = 6(用了三件物品1,或者一件物品1和一件物品2)
dp[4] = max(dp[4],dp[2]+w[2]) = 4 * w[1] = dp[2] + w[2] = 8(用了四件物品1或者,两件物品1和一件物品2或两件物品2)
dp[5] = max(dp[5],dp[3]+w[2]) = 5 * w[1] = dp[3] + w[2] = 10(用了五件物品1或者,三件物品1和一件物品2或一件物品1和两件物品2)
i = 3时:j从v[3]到5
dp[3] = max(dp[3],dp[0]+w[3]) = dp[3] = 6 # 保持第二轮的状态
dp[4] = max(dp[4],dp[1]+w[3]) = dp[4] = 8 # 保持第二轮的状态
dp[5] = max(dp[5],dp[2]+w[3]) = dp[4] = 10 # 保持第二轮的状态
i = 4时:j从v[4]到5
dp[4] = max(dp[4],dp[0]+w[4]) = dp[4] = 10 # 保持第三轮的状态
dp[5] = max(dp[5],dp[1]+w[4]) = dp[5] = 10 # 保持第三轮的状态
上面模拟了完全背包的全部过程,也可以看出,最后一轮的dp[m]即为最终的返回结果。
#include <bits/stdc++.h>
using namespace std;
int T, M;
long long dp[10000005], t[10005], m[10005];
int main()
{
cin >> T >> M;
for(int i = 1; i <= M; i++) cin >> t[i] >> m[i];
for(int i = 1; i <= M; i++){
for(int j = t[i]; j <= T; j++){//枚举
dp[j] = max(dp[j], dp[j - t[i]] + m[i]);
}
}
cout << dp[T] << endl;
return 0;
}
P1802 5 倍经验日
#include <bits/stdc++.h>
using namespace std;
int n, x, lose[1005], win[1005], use[1005];
long long f[1005];//不确定时用long long
int main()
{
cin >> n >> x;
for(int i = 1; i <= n; i++)
cin >> lose[i] >> win[i] >> use[i];
for(int i = 1; i <= n; i++){
for(int j = x; j >= 0; j--){//被打败或打赢
if(j >= use[i])
f[j] = max(f[j - use[i]] + win[i], f[j] + lose[i]);
else f[j] = f[j] + lose[i];
}
}
cout << f[x] * 5 << endl;
return 0;
}