P1048 [NOIP2005 普及组] 采药
思路:动态规划,背包
代码:#include<iostream>
using namespace std;
int T, M;
int tim[101], val[101];
int g[1001];
int main() {
cin >> T >> M;//采药时间、草药数目
for (int m = 1; m <= M; m++) cin >> tim[m] >> val[m];
//状态压缩核心代码
for (int m = 1; m <= M; m++) {
for (int t = T; t >= tim[m]; t--) {
g[t] = max(g[t], g[t - tim[m]] + val[m]);
}
}
cout << g[T] << endl;
return 0;
}
P1616 疯狂的采药
思路:动态规划,dp
代码:
#include <iostream>
using namespace std;
const int V = 1e7 + 10, N = 1e4 + 10;
int n, m;
int v[N], w[N];
long f[V];
int main() {
scanf("%d%d", &m, &n);
for (int i = 1; i <= n; i++)
scanf("%d%d", &v[i], &w[i]);
for (int i = 1; i <= n; i++)
for (int j = v[i]; j <= m; j++)
f[j] = max(f[j], f[j - v[i]] + w[i]);
printf("%ld\n", f[m]);
return 0;
}
P1049 [NOIP2001 普及组] 装箱问题
思路:动态规划,背包
#include<bits/stdc++.h>
#define N 20002
using namespace std;
int t,n,v[N],w[N],f[N];
int main()
{
cin>>t>>n;
for(int i=1;i<=n;i++) cin>>w[i],v[i]=w[i];
for(int i=1;i<=n;i++)
{
for(int j=t;j>=w[i];j--)
if(f[j-w[i]]+v[i]>f[j]) f[j]=f[j-w[i]]+v[i];
}
cout<<t-f[t];
return 0;
}
P1833 樱花
思路:动态规划
#include <iostream>
using namespace std;
const int N = 200010, M = 1010;
int n, m;
int f[M];
int v[N], w[N];
int main() {
int h1 = 0, h2 = 0, m1 = 0, m2 = 0;
scanf("%d:%d", &h1, &m1);
scanf("%d:%d", &h2, &m2);
scanf("%d", &n);
m = (h2 - h1) * 60 + m2 - m1;
for (int i = 1; i <= n; i++) {
int v0, w0, s;
scanf("%d%d%d", &v0, &w0, &s);
if (!s)
for (int j = v0; j <= m; j++) f[j] = max(f[j], f[j - v0] + w0);
else {
int c = 0;
for (int k = 1; k <= s; k <<= 1) {
v[++c] = k * v0;
w[c] = k * w0;
s -= k;
}
if (s) v[++c] = s * v0, w[c] = s * w0;
for (int k = 1; k <= c; k++)
for (int j = m; j >= v[k]; j--)
f[j] = max(f[j], f[j - v[k]] + w[k]);
}
}
printf("%d\n", f[m]);
}