ACM集训-动态规划
关注
分享
扫一扫
piekey1994
这个作者很懒，什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
POJ 2951 Cake Cutting（动态规划）
Description You are given a rectangular cake of integral dimensions w × h. Your goal is to divide this cake into m rectangular pieces of integral dimensions such that the area of the largest pie转载 2014-08-08 20:33:57 · 749 阅读 · 0 评论 -
maxsum（dp求最大子矩阵）
Judge Info Memory Limit: 32768KB Case Time Limit: 3000MS Time Limit: 3000MS Judger: Number Only Judger Description Given a two-dimensional array of positive and negative integers,原创 2014-08-08 20:26:02 · 418 阅读 · 0 评论