Title Link: http://acm.hdu.edu.cn/showproblem.php?pid=2602
The bare ...
1#include <algorithm>2#include <iostream>3#include <iomanip>4#include <cstring>5#include <climits>6#include <complex>7#include <fstream>8#include <cassert>9#include <cstdio>Ten#include <bitset> One#include <vector> A#include <deque> -#include <queue> -#include <stack> the#include <ctime> -#include <Set> -#include <map> -#include <cmath> + - using namespacestd; + A Const intMAXN =555555; at intN, M; - intV[MAXN]; - intW[MAXN]; - intDP[MAXN]; - - intMain () { in //freopen ("in", "R", stdin); - intT; toscanf"%d", &T); + while(t--) { -Memset (DP,0,sizeof(DP)); thememset (V,0,sizeof(v)); *Memset (W,0,sizeof(w)); $scanf"%d%d", &n, &m);Panax Notoginseng for(inti =1; I <= N; i++) scanf ("%d", &v[i]); - for(inti =1; I <= N; i++) scanf ("%d", &w[i]); the for(inti =1; I <= N; i++) { + for(intj = m; J >= W[i]; j--) { ADP[J] = max (Dp[j], dp[j-w[i]]+v[i]); the } + } -printf"%d\n", Dp[m]); $ } $ return 0; -}
[HDOJ2602] Bone Collector (01 backpack)