随笔分类 -  动态规划

摘要:The cows are trying to become better athletes, so Bessie is running on a track for exactly N (1 ≤ N ≤ 10,000) minutes. During each minute, she can cho 阅读全文
posted @ 2017-08-05 08:41 西北会法语 阅读(154) 评论(0) 推荐(0)
摘要:This is yet another problem dealing with regular bracket sequences. We should remind you that a bracket sequence is called regular, if by inserting «+ 阅读全文
posted @ 2017-08-03 16:15 西北会法语 阅读(209) 评论(0) 推荐(0)
摘要:Alex doesn't like boredom. That's why whenever he gets bored, he comes up with games. One long winter evening he came up with a game and decided to pl 阅读全文
posted @ 2017-08-03 16:14 西北会法语 阅读(195) 评论(0) 推荐(0)
摘要:The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye 阅读全文
posted @ 2017-08-03 16:09 西北会法语 阅读(272) 评论(0) 推荐(0)
摘要:A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence ( a1, a2, ..., aN) be any sequence ( ai1, 阅读全文
posted @ 2017-08-03 16:08 西北会法语 阅读(93) 评论(0) 推荐(0)
摘要:A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x1, x2, ..., xm > another 阅读全文
posted @ 2017-08-03 16:05 西北会法语 阅读(93) 评论(0) 推荐(0)
摘要:下图是个数字三角,请编写一个程序计算从顶部至底部某处一条路径,使得该路径所经过的数字总和最大。 7 3 8 8 1 0 2 7 4 4 1. 每一步可沿左斜线向下或右斜线向下走; 2. 1<=三角形行数<=100 3. 三角形中的数字为整数 0,1,……,99。 4. 如果有多种情况结果都最大,任意 阅读全文
posted @ 2017-08-03 16:04 西北会法语 阅读(173) 评论(0) 推荐(0)