标签:
Description
Input
Output
Sample Input
1 5 10 1 2 3 4 5 5 4 3 2 1
Sample Output
14 AC代码:#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int MAXN = 1010; int n, vb; int r[MAXN], v[MAXN]; int dp[MAXN][MAXN]; int rec(int i, int j) { if (dp[i][j] >= 0) { return dp[i][j]; } int res; if (i == n) { res = 0; } else if (j < r[i]) { res = rec(i + 1, j); } else { res = max (rec(i + 1, j), rec(i + 1, j - r[i]) + v[i]); } return dp[i][j] = res; } int main() { int t; scanf("%d", &t); while (t--) { memset(r, 0, sizeof (r)); memset(v, 0, sizeof (v)); memset(dp, -1, sizeof (dp)); scanf("%d%d", &n, &vb); for (int i=0; i<n; i++) { scanf("%d", &v[i]); } for ( int i=0; i<n; i++) { scanf("%d", &r[i]); } printf("%d\n", rec(0, vb)); } return 0; }
一次A了!
标签:
原文地址:http://blog.csdn.net/nuc_sheryl/article/details/51344174