07 2014 档案

KM算法（最优匹配）
摘要：hdu2255奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3453Accepted Submission(s): 1489Probl... 阅读全文
posted @ 2014-07-31 17:55 一样菜 阅读(1694) 评论(0) 推荐(0) 编辑
网络最大流解方程组
摘要：多校联赛第三场（hdu4888）Redraw Beautiful DrawingsTime Limit: 3000/1500 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1320Accep... 阅读全文
posted @ 2014-07-30 18:34 一样菜 阅读(276) 评论(0) 推荐(0) 编辑
网络费用流-最小k路径覆盖
摘要：多校联赛第一场（hdu4862）JumpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 644Accepted Submission(s): 275... 阅读全文
posted @ 2014-07-30 17:20 一样菜 阅读(473) 评论(0) 推荐(0) 编辑
树链剖分-点的分治（点数为k且距离最长的点对）
摘要：hdu4871Shortest-path treeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 130712/130712 K (Java/Others)Total Submission(s): 382Accepted Submission(... 阅读全文
posted @ 2014-07-28 20:35 一样菜 阅读(246) 评论(0) 推荐(0) 编辑
树链剖分-点的分治（链的点的个数为k的点对数）
摘要：hdu4760Cube number on a treeTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 878Accepted Submissi... 阅读全文
posted @ 2014-07-28 19:44 一样菜 阅读(176) 评论(0) 推荐(0) 编辑
树链剖分-点的分治（dis[i]+dis[j]==k的点对数量）
摘要：poj2114BoatherdsTime Limit:2000MSMemory Limit:65536KTotal Submissions:1195Accepted:387DescriptionBoatherds Inc. is a sailing company operating in the ... 阅读全文
posted @ 2014-07-28 19:08 一样菜 阅读(261) 评论(0) 推荐(0) 编辑
树链剖分-点的分治（dis[i]+dis[j]<=k的点对数量）
摘要：poj1741TreeTime Limit:1000MSMemory Limit:30000KTotal Submissions:10012Accepted:3024DescriptionGive a tree with n vertices,each edge has a length(posit... 阅读全文
posted @ 2014-07-28 18:49 一样菜 阅读(378) 评论(0) 推荐(0) 编辑
无向图欧拉通路
摘要：poj1300Door ManTime Limit:1000MSMemory Limit:10000KTotal Submissions:2020Accepted:801DescriptionYou are a butler in a large mansion. This mansion has ... 阅读全文
posted @ 2014-07-22 10:25 一样菜 阅读(299) 评论(0) 推荐(0) 编辑
无向图欧拉回路
摘要：1041John's tripTime Limit:1000MSMemory Limit:65536KTotal Submissions:6993Accepted:2302Special JudgeDescriptionLittle Johnny has got a new car. He deci... 阅读全文
posted @ 2014-07-21 19:41 一样菜 阅读(486) 评论(0) 推荐(0) 编辑
混合欧拉回路的判断（Dinic）
摘要：POJ1637Sightseeing tourTime Limit:1000MSMemory Limit:10000KTotal Submissions:7483Accepted:3115DescriptionThe city executive board in Lund wants to con... 阅读全文
posted @ 2014-07-21 11:19 一样菜 阅读(226) 评论(0) 推荐(0) 编辑
有向图欧拉通路
摘要：2337CatenymsTime Limit:1000MSMemory Limit:65536KTotal Submissions:9454Accepted:2486DescriptionA catenym is a pair of words separated by a period such ... 阅读全文
posted @ 2014-07-21 09:55 一样菜 阅读(786) 评论(0) 推荐(0) 编辑
欧拉回路的典型应用
摘要：CodeTime Limit:1000MSMemory Limit:65536KTotal Submissions:1943Accepted:706DescriptionKEY Inc., the leading company in security hardware, has developed... 阅读全文
posted @ 2014-07-20 12:08 一样菜 阅读(723) 评论(0) 推荐(0) 编辑
深搜的非递归写法
摘要：#include"stdio.h"#include"string.h"#include"queue"#include"stack"#include"iostream"#include"string"#include"map"#include"stdlib.h"#define inf 99999999... 阅读全文
posted @ 2014-07-20 11:12 一样菜 阅读(608) 评论(0) 推荐(0) 编辑
有向图欧拉回路
摘要：WatchcowTime Limit:3000MSMemory Limit:65536KTotal Submissions:5902Accepted:2538Special JudgeDescriptionBessie's been appointed the new watch-cow for t... 阅读全文
posted @ 2014-07-19 16:31 一样菜 阅读(613) 评论(0) 推荐(0) 编辑
网络流SAP+gap+弧优化算法
摘要：poj1273Drainage DitchesTime Limit:1000MSMemory Limit:10000KTotal Submissions:54962Accepted:20960DescriptionEvery time it rains on Farmer John's fields... 阅读全文
posted @ 2014-07-19 12:39 一样菜 阅读(368) 评论(0) 推荐(0) 编辑
图论集合
摘要：【HDU】1213 How Many Tables 根蒂根基并查集★1272 小希的迷宫 根蒂根基并查集★1325&&poj1308 Is It A Tree？ 根蒂根基并查集★1856 More is better 根蒂根基并查集★1102 Constructing Roads 根蒂根基最小生成树... 阅读全文
posted @ 2014-07-18 16:27 一样菜 阅读(263) 评论(0) 推荐(0) 编辑
无向连通图求割点（tarjan算法去掉改割点剩下的联通分量数目）
摘要：poj2117ElectricityTime Limit:5000MSMemory Limit:65536KTotal Submissions:3603Accepted:1213DescriptionBlackouts and Dark Nights (also known as ACM++) is... 阅读全文
posted @ 2014-07-09 21:22 一样菜 阅读(362) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示