中文题意不概述
思路: 昨天打的时候想到了状态,想到了大概是用完全背包转移,但是不会第 i 天怎么由第
i
−
1
i - 1
i−1天推来。。。还是 tcl
- d p [ i ] [ j ] dp[i][j] dp[i][j] 表示到第 i i i 天,手中的节点数为 j j j 时最后一天最大得到节点数。
- 那么首先有 d p [ i ] [ j + f [ j ] ] = m a x ( d p [ i ] [ j + f [ j ] ] , d p [ i − 1 ] [ j ] ) dp[i][j + f[j]] = max(dp[i][j+ f[j]],dp[i - 1][j]) dp[i][j+f[j]]=max(dp[i][j+f[j]],dp[i−1][j])
- 然后做完全背包,但是有一点不同的是,这里的完全背包 d p [ j ] dp[j] dp[j] 表示剩余容量为 j j j 时获得的最大价值
Code:
#include<bits/stdc++.h>
#define debug(x) cerr << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a, b) memset((a),b,sizeof(a))
#define rep(i, a, b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define fi first
#define se second
#define ptch putchar
#define CLR(a) while(!(a).empty()) a.pop()
using namespace std;
inline LL read() {
LL s = 0, w = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
w = -1;
ch = getchar();
}
while (isdigit(ch))
s = s * 10 + ch - '0', ch = getchar();
return s * w;
}
inline void write(LL x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
write(x / 10);
putchar(x % 10 + '0');
}
#ifndef ONLINE_JUDGE
clock_t prostart = clock();
#endif
const int maxn = 110;
int f[maxn * 10];
int a[maxn], b[maxn];
int dp[maxn][maxn * 20];
int main() {
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int n = read(), m = read(), k = read();
for (int i = 0; i < k + 1; ++i) f[i] = read();
for (int i = 1; i <= m; ++i) {
a[i] = read();
b[i] = read();
}
clr(dp,-0x3f);
dp[1][0] = 0;
for(int i = 2;i <= n;++ i){
for(int j = 0;j <= k;++ j)
dp[i][j + f[j]] = max(dp[i][j + f[j]],dp[i - 1][j]);
for(int j = 1;j <= m;++ j)
for(int w = 1000;w >= 0;-- w)
dp[i][w] = max(dp[i][w + a[j]] + b[j],dp[i][w]);
}
int ans = 0;
for(int i = 0;i <= 1000;++ i)
ans = max(ans,dp[n][i] + i + f[i]);
write(ans); ptch('\n');
#ifndef ONLINE_JUDGE
cerr << "time: " << 1.0 * (clock() - prostart) / CLOCKS_PER_SEC << " s" << endl;
#endif
return 0;
}