I am a slow walker,but I never walk backwards. Abraham Lincoln

GeekZRF

随笔分类 -  OJ:POJ

1 2 下一页

北京大学ACM
POJ 2152.Fire 树形dp
摘要:Fire Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 1616 Accepted: 878 Description Country Z has N cities, which are numbered from 1 to N. 阅读全文

posted @ 2017-10-06 15:58 GeekZRF 阅读(190) 评论(0) 推荐(0)

POJ 3162.Walking Race 树形dp 树的直径
摘要:Walking Race Time Limit: 10000MS Memory Limit: 131072K Total Submissions: 4123 Accepted: 1029 Case Time Limit: 3000MS Description flymouse’s sister wc 阅读全文

posted @ 2017-10-02 15:39 GeekZRF 阅读(289) 评论(0) 推荐(0)

POJ 3140.Contestants Division 基础树形dp
摘要:Contestants Division Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10704 Accepted: 3004 Description In the new ACM-ICPC Regional Contest, 阅读全文

posted @ 2017-09-29 15:46 GeekZRF 阅读(202) 评论(0) 推荐(0)

POJ 2378.Tree Cutting 树形dp 树的重心
摘要:Tree Cutting Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4834 Accepted: 2958 Description After Farmer John realized that Bessie had ins 阅读全文

posted @ 2017-09-29 14:17 GeekZRF 阅读(186) 评论(0) 推荐(0)

POJ 1741.Tree 树分治 树形dp 树上点对
摘要:Tree Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 24258 Accepted: 8062 Description Give a tree with n vertices,each edge has a length(po 阅读全文

posted @ 2017-09-21 16:51 GeekZRF 阅读(155) 评论(0) 推荐(0)

POJ 3107.Godfather 树形dp
摘要:Godfather Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 7536 Accepted: 2659 Description Last years Chicago was full of gangster fights an 阅读全文

posted @ 2017-09-20 18:32 GeekZRF 阅读(158) 评论(0) 推荐(0)

POJ 1655.Balancing Act 树形dp 树的重心
摘要:Balancing Act Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14550 Accepted: 6173 Description Consider a tree T with N (1 <= N <= 20,000) 阅读全文

posted @ 2017-09-19 22:09 GeekZRF 阅读(162) 评论(0) 推荐(0)

POJ 3683.Priest John's Busiest Day 2-SAT
摘要:Priest John's Busiest Day Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10144 Accepted: 3472 Special Judge Description John is the only p 阅读全文

posted @ 2017-08-04 21:18 GeekZRF 阅读(197) 评论(0) 推荐(0)

POJ 3686.The Windy's 最小费用最大流
摘要:The Windy's Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5477 Accepted: 2285 Description The Windy's is a world famous toy factory that 阅读全文

posted @ 2017-07-29 22:16 GeekZRF 阅读(179) 评论(0) 推荐(0)

POJ 3469.Dual Core CPU 最大流dinic算法模板
摘要:Dual Core CPU Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 24830 Accepted: 10756 Case Time Limit: 5000MS Description As more and more 阅读全文

posted @ 2017-07-29 17:31 GeekZRF 阅读(255) 评论(0) 推荐(0)

POJ 2135.Farm Tour 消负圈法最小费用最大流
摘要:Evacuation Plan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4914 Accepted: 1284 Special Judge Description The City has a number of muni 阅读全文

posted @ 2017-07-29 11:03 GeekZRF 阅读(520) 评论(0) 推荐(0)

POJ 3281.Dining 最大流
摘要:Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18479 Accepted: 8243 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文

posted @ 2017-07-27 18:30 GeekZRF 阅读(164) 评论(2) 推荐(0)

POJ 3041.Asteroids 最小顶点覆盖
摘要:Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22905 Accepted: 12421 Description Bessie wants to navigate her spaceship through 阅读全文

posted @ 2017-07-23 16:04 GeekZRF 阅读(191) 评论(0) 推荐(0)

POJ 2014.K-th Number 区间第k小 (归并树)
摘要:K-th Number Time Limit: 20000MS Memory Limit: 65536K Total Submissions: 57543 Accepted: 19893 Case Time Limit: 2000MS Description You are working for 阅读全文

posted @ 2017-07-11 21:38 GeekZRF 阅读(183) 评论(0) 推荐(0)

分桶法和平方分割
摘要:分桶法:把一排物品或者平面分成桶,每个桶分别维护自己内部的信息,已到达高效计算的目的的方法。 其中,平方分割是把排成一排的n个元素每√n个分在一个桶内进行维护的方法的统称。这样的方法可以使对区间的操作复杂度降至O(√n)。 以RMQ为例: 基于平方分割的RMQ 给定一个数列a1,a2,a3,a4,a 阅读全文

posted @ 2017-07-08 13:48 GeekZRF 阅读(402) 评论(0) 推荐(0)

POJ 3320.Jessica's Reading Problem 尺取法
摘要:Jessica's Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12488 Accepted: 4255 Description Jessica's a very lovely girl woo 阅读全文

posted @ 2017-07-04 21:33 GeekZRF 阅读(154) 评论(0) 推荐(0)

POJ 3061.Subsequence 尺取法
摘要:Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 14910 Accepted: 6301 Description A sequence of N positive integers (10 < N < 10 阅读全文

posted @ 2017-07-04 21:08 GeekZRF 阅读(145) 评论(0) 推荐(0)

POJ 3169.Layout 最短路
摘要:Layout Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11612 Accepted: 5550 Description Like everyone else, cows like to stand close to the 阅读全文

posted @ 2017-06-23 13:40 GeekZRF 阅读(155) 评论(0) 推荐(0)

POJ 3723.Conscription 最小生成树
摘要:Conscription Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 13438 Accepted: 4699 Description Windy has a country, and he wants to build an 阅读全文

posted @ 2017-06-21 11:25 GeekZRF 阅读(221) 评论(0) 推荐(0)

POJ 1182.食物链 并查集
摘要:食物链 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 72110 Accepted: 21369 Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动 阅读全文

posted @ 2017-06-13 15:19 GeekZRF 阅读(153) 评论(0) 推荐(0)

1 2 下一页

导航