HDU 2602 Bone Collector
2012-08-29 20:38
183 查看
http://acm.hdu.edu.cn/showproblem.php?pid=2602
水题一道,依旧是0/1背包的问题。。。加深理解O(∩_∩)O~
View Code
水题一道,依旧是0/1背包的问题。。。加深理解O(∩_∩)O~
View Code
#include <iostream> #define maxn 1005 using namespace std; long ans[maxn], v[maxn], w[maxn]; int main() { long t, n, m, i,j; cin >> t; while(t--) { cin >> n >> m; for(i = 0; i < n; i++) cin >> w[i]; for(i = 0; i < n; i++) cin >> v[i]; for(i = 0; i <= m; i++) ans[i] = 0; for(i = 0; i < n; i++) for(j = m; j >= v[i]; j--) if(ans[j-v[i]] + w[i] > ans[j]) ans[j] = ans[j-v[i]]+w[i]; cout << ans[m]<< endl; } return 0; }
相关文章推荐
- HDU 2602 Bone Collector - from lanshui_Yang
- hdu 2602 Bone Collector 01背包
- HDU_2602 Bone Collector(DP)
- HDU 2602 Bone Collector (01背包)
- HDU 2602 Bone Collector(01背包)
- HDU 2602(Bone Collector)基础0-1背包问题
- HDU 2602|Bone Collector|裸01背包问题
- HDU 2602 Bone Collector【01背包】
- HDU - 2602 Bone Collector (01背包)
- hdu 2602 Bone Collector (01背包)
- hdu 2602 Bone Collector 背包入门题
- HDU 2602 Bone Collector
- Bone Collector(hdu 2602)
- 01背包问题之HDU——2602 Bone Collector
- HDU 2602 Bone Collector
- HDU 2602 - Bone Collector
- hdu 2602 Bone Collector 01背包
- HDU 2602 Bone Collector
- HDU2602_Bone Collector(背包/01背包)
- HDU 2602 Bone Collector(01背包问题)