ZefengYao - 博客园

L2-020. 功夫传人

摘要： L2-020. 功夫传人时间限制 400 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者陈越时间限制 400 ms 时间限制 400 ms 内存限制 65536 kB 内存限制 65536 kB 代码长度限制 8000 B 代码长度限制 8000 阅读全文

posted @ 2017-03-29 16:04 ZefengYao 阅读(1489) 评论(0) 推荐(0) 编辑

poj 2886 Who Gets the Most Candies?

摘要： Who Gets the Most Candies? Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 14264 Accepted: 4504 Case Time Limit: 2000MS Description N chil 阅读全文

posted @ 2017-03-25 15:50 ZefengYao 阅读(353) 评论(0) 推荐(0) 编辑

poj 2155 Matrix

摘要： Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 26668 Accepted: 9830 Description Given an N*N matrix A, whose elements are either 0 阅读全文

posted @ 2017-03-22 23:47 ZefengYao 阅读(88) 评论(0) 推荐(0) 编辑

poj 3109

摘要： Inner Vertices Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 2447 Accepted: 678 Case Time Limit: 2000MS Description There is an infinite 阅读全文

posted @ 2017-03-19 21:47 ZefengYao 阅读(410) 评论(0) 推荐(0) 编辑

poj 1990 MooFest

摘要： MooFest Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 7513 Accepted: 3373 Description Every year, Farmer John's N (1 <= N <= 20,000) cows 阅读全文

posted @ 2017-03-18 19:50 ZefengYao 阅读(178) 评论(0) 推荐(1) 编辑

超大背包问题

摘要：题意：有重和价值分别为wi,vi的n个物品。从这些物品中挑选出总质量不超过W的物品，求所有挑选出的方案中价值总量的最大值。限制条件：1<=n<=40 1<=wi,vi<=10^15 1<=W<=10^15 思路：此题如果用动态规划求解复杂度为O(nW),故不划算。可以考虑折半搜索的方法，将所阅读全文

posted @ 2017-03-11 11:54 ZefengYao 阅读(202) 评论(0) 推荐(0) 编辑

Sumsets

摘要： Sumsets Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11046 Accepted: 3024 Description Given S, a set of integers, find the largest d suc 阅读全文

posted @ 2017-03-09 13:31 ZefengYao 阅读(225) 评论(0) 推荐(0) 编辑

poj 3977 Subset

摘要： Subset Time Limit: 30000MS Memory Limit: 65536K Total Submissions: 3662 Accepted: 673 Description Given a list of N integers with absolute values no l 阅读全文

posted @ 2017-03-06 18:49 ZefengYao 阅读(226) 评论(0) 推荐(1) 编辑

poj 2674 Linear world

摘要： Linear world Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 3599 Accepted: 810 Description The Disc, being flat, has no real horizon. Any 阅读全文

posted @ 2017-03-06 13:58 ZefengYao 阅读(142) 评论(0) 推荐(0) 编辑

poj 3185 The Water Bowls

摘要： The Water Bowls Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6241 Accepted: 2453 Description The cows have a line of 20 water bowls from 阅读全文

posted @ 2017-03-05 15:00 ZefengYao 阅读(238) 评论(0) 推荐(0) 编辑