原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=3829题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=17572#problem/E（CSUST图论训练赛）二分匹配，求最大独立集。Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1870Accepted Submission(s): 633Probl Read More
原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field Read More
原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field Read More
题目链接：http://poj.org/problem?id=1469COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:14455Accepted:5715DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of e Read More
转载来源：http://www.cnblogs.com/kuangbin/archive/2012/08/26/2657446.html无限膜拜kb神啊！！！二分图匹配（匈牙利算法）1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数König定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一下：假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来覆盖所有的边。2。最小路径覆盖=最小路径覆盖＝｜G｜－最大匹配数在一个N*N的有向图中，路径覆盖就是在图中找一些路经，使之覆盖了图 Read More
原题链接：http://poj.org/problem?id=1094同ZOJ 1060：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1060Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:21983Accepted:7574DescriptionAnascending sorted sequence of distinct values is one in which some form of aless-than op Read More
初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 Read More
初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 Read More
初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 Read More
原题链接：http://poj.org/problem?id=1258周四上了节数据结构终于知道何为最小生成树，晚上回寝，遂得此题！Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:29613Accepted:11750Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He Read More