![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
01背包
文章平均质量分 86
kyoma
这个kyoma就是逊啦
展开
-
hdu2602 Bone Collector 01背包教学题
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 52285 Accepted Submission(s): 22035Problem DescriptionMany year原创 2016-09-01 10:44:02 · 525 阅读 · 0 评论 -
hdu2546 饭卡 01背包 贪心 TWT Tokyo Olympic--1 Combo -1
饭卡Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23644 Accepted Submission(s): 8310Problem Description电子科大本部食堂的饭卡有一种很诡异的设计,即原创 2016-09-01 11:33:04 · 435 阅读 · 0 评论 -
hdu2639 bone collector II 01背包第k优解 TWT Tokyo Olympic 1COMBO-1
#include #include #include #include #include #include int value[110],v[110];int f[110][1010][35];int killme[1010];using namespace std;int main(){ int t; scanf("%d",&t); while(t--原创 2016-09-09 21:03:12 · 530 阅读 · 2 评论 -
hdu1864 最大报销额 01背包 TWT tokyo Olympic 1combo-1
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22735 Accepted Submission(s): 6921Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括原创 2016-09-22 17:00:46 · 353 阅读 · 0 评论 -
HDU3466 Proud Merchants 01背包 思考 TWT Tokyo Olympic 2Combo -2 未完待续
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 5524 Accepted Submission(s): 2326Problem DescriptionRecently,原创 2016-09-21 00:50:46 · 524 阅读 · 0 评论 -
HDU1171 Big Event in HDU 01背包 母函数 TWT Tokyo Olympic 2COMBO-1 未完待续
Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36353 Accepted Submission(s): 12631Problem DescriptionNowada原创 2016-09-02 15:53:35 · 541 阅读 · 0 评论 -
hhu1017 最小差 动态规划dp 01背包
1017: 最小差时间限制: 1 Sec 内存限制: 128 MB提交: 38 解决: 11[提交][状态][讨论版]题目描述假设有n个正整数a1,a2,a3…an,希望将这些数分成两组,使得两组的和差值最小。输入第一行输入整数m(0接下来每个用例由两行组成,第一行是一个整数n(1输出输出最小的差的绝对值。样例输入原创 2016-11-18 16:25:11 · 978 阅读 · 0 评论 -
HDU2955 Robberies 01背包 TWT Tokyo Olympic 2Combo -2
#include #include #include #include #include #include #include #include #include #include using namespace std;const int maxn=100010;const double epthro=1e-8;double f[maxn];int M[maxn];d原创 2016-09-20 17:33:44 · 373 阅读 · 0 评论