上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 54 下一页
摘要: 1553: Good subsequence Description Give you a sequence of n numbers, and a number k you should find the max length of Good subsequence. Good subsequen 阅读全文
posted @ 2016-08-21 16:55 樱花庄的龙之介大人 阅读(201) 评论(0) 推荐(0) 编辑
摘要: 1556: Jerry's trouble Description Jerry is caught by Tom. He was penned up in one room with a door, which only can be opened by its code. The code is 阅读全文
posted @ 2016-08-21 16:05 樱花庄的龙之介大人 阅读(152) 评论(0) 推荐(0) 编辑
摘要: 1549: Navigition Problem Description Navigation is a field of study that focuses on the process of monitoring and controlling the movement of a craft 阅读全文
posted @ 2016-08-21 15:52 樱花庄的龙之介大人 阅读(338) 评论(0) 推荐(0) 编辑
摘要: 1550: Simple String Description Welcome,this is the 2015 3th Multiple Universities Programming Contest ,Changsha ,Hunan Province. In order to let you 阅读全文
posted @ 2016-08-21 13:11 樱花庄的龙之介大人 阅读(213) 评论(0) 推荐(0) 编辑
摘要: 1548: Design road Description You need to design road from (0, 0) to (x, y) in plane with the lowest cost. Unfortunately, there are N Rivers between ( 阅读全文
posted @ 2016-08-21 10:28 樱花庄的龙之介大人 阅读(164) 评论(0) 推荐(0) 编辑
摘要: 1547: Rectangle Description Now ,there are some rectangles. The area of these rectangles is 1* x or 2 * x ,and now you need find a big enough rectangl 阅读全文
posted @ 2016-08-21 09:43 樱花庄的龙之介大人 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 1592: 石子归并 Description 现在有n堆石子,第i堆有ai个石子。现在要把这些石子合并成一堆,每次只能合并相邻两个,每次合并的代价是两堆石子的总石子数。求合并所有石子的最小代价。 现在有n堆石子,第i堆有ai个石子。现在要把这些石子合并成一堆,每次只能合并相邻两个,每次合并的代价是两 阅读全文
posted @ 2016-08-20 20:29 樱花庄的龙之介大人 阅读(237) 评论(0) 推荐(0) 编辑
摘要: 描述 There is a funny car racing in a city with n junctions and m directed roads. The funny part is: each road is open and closed periodically. Each roa 阅读全文
posted @ 2016-08-20 09:58 樱花庄的龙之介大人 阅读(311) 评论(0) 推荐(0) 编辑
摘要: 1329: 一行盒子 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 693 Solved: 134 [Submit][Status][Web Board] Description 你有一行盒子,从左到右依次编号为1, 2, 3,…, n。你可以执行四种 阅读全文
posted @ 2016-08-19 22:03 樱花庄的龙之介大人 阅读(208) 评论(0) 推荐(0) 编辑
摘要: Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 18561 Accepted: 9209 Description Railway tickets were difficult to buy around t 阅读全文
posted @ 2016-08-18 23:10 樱花庄的龙之介大人 阅读(231) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 54 下一页