摘要: Ice_cream's world ITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 549Accepted Submission(s): 308P... 阅读全文
posted @ 2014-08-09 20:07 SixDayCoder 阅读(211) 评论(0) 推荐(0) 编辑
摘要: 逃离迷宫Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 15281Accepted Submission(s): 3692Problem Descr... 阅读全文
posted @ 2014-08-08 11:17 SixDayCoder 阅读(179) 评论(0) 推荐(0) 编辑
摘要: Quoit DesignTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30677Accepted Submission(s): 8060Prob... 阅读全文
posted @ 2014-08-07 19:19 SixDayCoder 阅读(434) 评论(0) 推荐(0) 编辑
摘要: 欧拉回路Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9300Accepted Submission(s): 3340Problem Descri... 阅读全文
posted @ 2014-08-06 19:34 SixDayCoder 阅读(228) 评论(0) 推荐(0) 编辑
摘要: Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5338Accepted Submission(s): 1733Prob... 阅读全文
posted @ 2014-08-06 17:19 SixDayCoder 阅读(179) 评论(0) 推荐(0) 编辑
摘要: 改革春风吹满地Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18591Accepted Submission(s): 9515Problem De... 阅读全文
posted @ 2014-08-05 21:43 SixDayCoder 阅读(328) 评论(0) 推荐(0) 编辑
摘要: 寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10762Accepted Submission(s): 5460Problem Descr... 阅读全文
posted @ 2014-08-05 14:58 SixDayCoder 阅读(176) 评论(0) 推荐(0) 编辑
摘要: Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6292Accepted Submission(s): 3558Problem De... 阅读全文
posted @ 2014-08-05 10:48 SixDayCoder 阅读(278) 评论(0) 推荐(0) 编辑
摘要: 资料摘自背包九讲 andhttp://blog.csdn.net/wumuzi520/article/details/7014830 andhttp://www.wutianqi.com/?p=539首先说明一下什么是完全背包有N种物品和一个容量为V的背包,每种物品都有无限件可用。第i种物品的费用是... 阅读全文
posted @ 2014-08-04 09:55 SixDayCoder 阅读(521) 评论(0) 推荐(0) 编辑
摘要: 在看了背包九讲以及http://blog.csdn.net/wumuzi520/article/details/7014559这篇博文之后,对于01背包有了更好的理解,下面整理一下以备以后回顾之用。首先,说明一下什么是01背包问题。一共有N个物品,每个物品的价值是w[i],重量是c[i],给你一个容... 阅读全文
posted @ 2014-08-04 08:08 SixDayCoder 阅读(1387) 评论(1) 推荐(0) 编辑