04 2014 档案

无向连通图至少增加多少边形成双联通
摘要：poj3177Redundant PathsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8558Accepted:3712DescriptionIn order to get from one of the F (1 2 and 1 ... 阅读全文
posted @ 2014-04-30 10:49 一样菜 阅读(681) 评论(0) 推荐(0) 编辑
最大流最小割求最小割点集（存在多种情况输出字典序最小的割点集）
摘要：poj1815FriendshipTime Limit:2000MSMemory Limit:20000KTotal Submissions:8768Accepted:2462DescriptionIn modern society, each person has his own friends.... 阅读全文
posted @ 2014-04-29 19:13 一样菜 阅读(493) 评论(0) 推荐(0) 编辑
最大流最小割求割边
摘要：hdu3251Being a HeroTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 867Accepted Submission(s): 27... 阅读全文
posted @ 2014-04-29 13:43 一样菜 阅读(404) 评论(0) 推荐(0) 编辑
求全局最小割（SW算法）
摘要：hdu3002King of DestructionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1022Accepted Submission(... 阅读全文
posted @ 2014-04-28 10:46 一样菜 阅读(493) 评论(0) 推荐(0) 编辑
求割边最小的最小割
摘要：hdu3987Harry Potter notices some Death Eaters try to slip into Castle. The Death Eaters hide in the most depths of Forbidden Forest. Harry need stop t... 阅读全文
posted @ 2014-04-28 10:41 一样菜 阅读(439) 评论(0) 推荐(0) 编辑
最大流最小割的综合运用
摘要：hdu3820Golden EggsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 367Accepted Submission(s): 208Pr... 阅读全文
posted @ 2014-04-28 10:31 一样菜 阅读(375) 评论(0) 推荐(0) 编辑
最大流最小割（最大点权独立集）
摘要：hdu3657GameTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 832Accepted Submission(s): 351Problem D... 阅读全文
posted @ 2014-04-28 10:17 一样菜 阅读(274) 评论(0) 推荐(0) 编辑
最大流最大点权独立集
摘要：hdu1569方格取数(2)Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4185Accepted Submission(s): 1300Pro... 阅读全文
posted @ 2014-04-22 17:41 一样菜 阅读(372) 评论(0) 推荐(0) 编辑
最大网络流（Dinic）
摘要：hdu1532Drainage DitchesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8043Accepted Submission(s):... 阅读全文
posted @ 2014-04-22 15:01 一样菜 阅读(164) 评论(0) 推荐(0) 编辑
旋转卡壳法求点集最小外接矩形（面积）并输出四个顶点坐标
摘要：BZOJ1185: [HNOI2007]最小矩形覆盖Time Limit:10 SecMemory Limit:162 MBSecSpecial JudgeSubmit:430Solved:202[Submit][Status]Description#include"stdio.h"#include... 阅读全文
posted @ 2014-04-22 09:26 一样菜 阅读(1813) 评论(0) 推荐(0) 编辑
旋转卡壳法求点集的最小覆盖矩形面积以及周长
摘要：旋转卡壳法求点集的最小覆盖矩形面积以及周长uva12307Problem HSmallest Enclosing RectangleThere are n points in 2D space. You're to find a smallest enclosing rectangle of the... 阅读全文
posted @ 2014-04-22 08:35 一样菜 阅读(633) 评论(0) 推荐(0) 编辑
旋转卡壳法求最大三角形
摘要：poj2079TriangleTime Limit:3000MSMemory Limit:30000KTotal Submissions:8023Accepted:2368DescriptionGiven n distinct points on a plane, your task is to f... 阅读全文
posted @ 2014-04-18 18:38 一样菜 阅读(293) 评论(0) 推荐(0) 编辑
旋转卡壳法求凸包的直径
摘要：poj 2187Beauty ContestTime Limit:3000MSMemory Limit:65536KTotal Submissions:26545Accepted:8184DescriptionBessie, Farmer John's prize cow, has just won... 阅读全文
posted @ 2014-04-18 18:06 一样菜 阅读(389) 评论(0) 推荐(0) 编辑
判断两线段是否相交（快速排斥和跨立）
摘要：背景知识：判断两线段是否相交： 我们分两步确定两条线段是否相交： (1)快速排斥试验 设以线段 P1P2 为对角线的矩形为R， 设以线段 Q1Q2 为对角线的矩形为T， 如果R和T不相交，显然两线段不会相交。 (2)跨立试验 如果两线段相交，则两线段必然相互跨立对方。若P1P2... 阅读全文
posted @ 2014-04-18 16:42 一样菜 阅读(771) 评论(0) 推荐(0) 编辑
LCA在线算法（hdu2586）
摘要：hdu2586How far away ？Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4183Accepted Submission(s): 1... 阅读全文
posted @ 2014-04-09 15:01 一样菜 阅读(216) 评论(0) 推荐(0) 编辑
LCA（离线算法）
摘要：hdu4547CD操作Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1010Accepted Submission(s): 275Problem... 阅读全文
posted @ 2014-04-09 14:31 一样菜 阅读(238) 评论(0) 推荐(0) 编辑
KMP的next数组性质运用
摘要：hdu2594Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2525Accepted Submis... 阅读全文
posted @ 2014-04-08 18:06 一样菜 阅读(407) 评论(0) 推荐(0) 编辑
kmp的next数组的运用（求字符串的最小循环节）
摘要：hdu3746Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2262Accepted Submission(s): ... 阅读全文
posted @ 2014-04-08 17:39 一样菜 阅读(298) 评论(0) 推荐(0) 编辑
KMP
摘要：#include"stdio.h"#include"string.h"#define M 4444int next[M],ans;void getNext(char *b){ int i,j; i=0; j=-1; next[0]=-1; while(b[i]!='\0... 阅读全文
posted @ 2014-04-08 16:54 一样菜 阅读(150) 评论(0) 推荐(0) 编辑
最舒适的路（并查集+枚举）（hdu1598）
摘要：hdu1598find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3300Accepted ... 阅读全文
posted @ 2014-04-08 16:14 一样菜 阅读(184) 评论(0) 推荐(0) 编辑
整数快速幂hdu（1852）
摘要：hdu1852Beijing 2008Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 502 Accepted Submission(s): 17... 阅读全文
posted @ 2014-04-06 00:03 一样菜 阅读(152) 评论(0) 推荐(0) 编辑
2-sat+二分搜索hdu(3622)
摘要：hdu3622Bomb GameTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3350 Accepted Submission(s): 114... 阅读全文
posted @ 2014-04-03 15:50 一样菜 阅读(174) 评论(0) 推荐(0) 编辑
2-sat(tarjan算法)hdu(1824)
摘要：hdu1824Let's go homeTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1291 Accepted Submission(s):... 阅读全文
posted @ 2014-04-03 14:56 一样菜 阅读(572) 评论(0) 推荐(0) 编辑
2-sat入门（tarjan）hdu（3062）
摘要：hdu3062PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3772Accepted Submission(s): 1226Proble... 阅读全文
posted @ 2014-04-02 19:13 一样菜 阅读(203) 评论(0) 推荐(0) 编辑
判断强联通图中每条边是否只在一个环上（hdu3594）
摘要：hdu3594CactusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1131Accepted Submission(s): 542Proble... 阅读全文
posted @ 2014-04-02 17:42 一样菜 阅读(248) 评论(0) 推荐(0) 编辑