四边形优化
关注
分享
扫一扫
Black_Glasses
这个作者很懒，什么都没留下…
展开
-
POJ - 1160 Post Office
Post OfficeTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21002 Accepted: 11353DescriptionThere is a straight highway with villages alongside the highway. The highway is represented as an i...原创 2018-05-25 13:29:51 · 159 阅读 · 0 评论 -
hdu3516-Tree Construction
Tree ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1708 Accepted Submission(s): 964Problem DescriptionConsider a two-dimensiona...原创 2018-05-25 13:47:38 · 166 阅读 · 0 评论 -
hdu2829-Lawrence
LawrenceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4903 Accepted Submission(s): 2258Problem DescriptionT. E. Lawrence was a controversia...原创 2018-05-25 13:58:36 · 180 阅读 · 0 评论 -
hdu3480-Division
DivisionTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 999999/400000 K (Java/Others)Total Submission(s): 5640 Accepted Submission(s): 2235Problem DescriptionLittle D is really interested ...原创 2018-05-25 14:05:33 · 156 阅读 · 0 评论 -
51nod-1021 石子归并
1021 石子归并 基准时间限制：1 秒 空间限制：131072 KB 分值: 20 难度：3级算法题 收藏 关注N堆石子摆成一条线。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的代价。计算将N堆石子合并成一堆的最小代价。例如： 1 2 3 4，有不少合并方法1 2 3 4 => 3 3 4(3) => 6 4(9) =>...原创 2018-05-23 16:28:00 · 201 阅读 · 0 评论