![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
Hanylch
菜鸟的起飞之路
Think and Practice
展开
-
Hdu 1176 免费馅饼 (动态规划)
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 48350 Accepted Submission(s): 16755Problem Description 都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽原创 2017-05-17 21:52:34 · 191 阅读 · 0 评论 -
多重背包(二进制优化)
类似于poj 1014 qduoj#include<bits/stdc++.h> #define maxn 100007using namespace std;int mm[20][20]; int dp[maxn]; int v[maxn]; int w[maxn];int main() { int n,m,t; scanf("%d",&t); while(t--)原创 2017-06-07 19:42:14 · 428 阅读 · 0 评论