动态规划
数星星的夜晚
疏雨滴梧桐
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
nyoj 546 Divideing Jewels 第五届河南省程序设计大赛
Divideing Jewels 描述 Mary and Rose own a collection of jewells. They want to split the collection among themselves so that both receive an equal share of the jewels. This would be easy if all the j原创 2016-05-28 10:07:58 · 544 阅读 · 0 评论 -
nyoj 1255 Rectangles 第七届河南省程序设计大赛
Rectangles 时间限制:1000 ms | 内存限制:65535 KB 难度:2 描述 Given N (4 <= N <= 100) rectangles and the lengths of their sides ( integers in the range 1..1,000), write a program that finds the maximum K原创 2016-05-28 19:20:33 · 467 阅读 · 0 评论
分享