图论 - 随笔分类 - Zee、

hdu Uncle Tom's Inherited Land*

摘要：Uncle Tom's Inherited Land*Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1011Accepted Submission(s): 445Special JudgeProblem DescriptionYour old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been 阅读全文

posted @ 2012-08-11 10:01 Zee、阅读(295) 评论(0) 推荐(0)

hdu 2768 Cat vs. Dog 最大独立集

摘要：Cat vs. DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 967Accepted Submission(s): 356Problem DescriptionThe latest reality show has hit the TV: ``Cat vs. Dog''. In this show, a bunch of cats and dogs compete for the very prestigious Bes 阅读全文

posted @ 2012-08-10 14:49 Zee、阅读(930) 评论(1) 推荐(0)

hdu 1068 最大独立集=节点数-最大匹配

摘要：Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4490Accepted Submission(s): 1954Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically 阅读全文

posted @ 2012-08-08 16:19 Zee、阅读(496) 评论(0) 推荐(0)

hdu 2255 KM算法

摘要：奔小康赚大钱Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 893Accepted Submission(s): 412Problem Description传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。另一方面,村长和另外阅读全文

posted @ 2012-08-08 09:42 Zee、阅读(318) 评论(0) 推荐(0)

KM 最优匹配讲解

摘要：转：基本原理该算法是通过给每个顶点一个标号（叫做顶标）来把求最大权匹配的问题转化为求完备匹配的问题的。设顶点Xi的顶标为A[ i ]，顶点Yj的顶标为B[ j ]，顶点Xi与Yj之间的边权为w[i,j]。在算法执行过程中的任一时刻，对于任一条边(i,j)，A[ i ]+B[j]>=w[i,j]始终成立。 KM算法的正确性基于以下定理：若由二分图中所有满足A[ i ]+B[j]=w[i,j]的边(i,j)构成的子图（称做相等子图）有完备匹配，那么这个完备匹配就是二分图的最大权匹配。这个定理是显然的。因为对于二分图的任意一个匹配，如果它包含于相等子图，那么它的边权和等于所有顶点的顶标. 阅读全文

posted @ 2012-08-07 09:21 Zee、阅读(788) 评论(0) 推荐(0)

hdu 2603 过山车最大匹配，匈牙利算法模板（易理解）

摘要：转：过山车Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4934 Accepted Submission(s): 2147Problem DescriptionRPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的每一排只有两个座位，而且还有条不成文的规矩，就是每个女生必须找个个男生做partner和她同坐。但是，每个女孩都有各自的想法，举个例子把，Rabbit只愿意和X... 阅读全文

posted @ 2012-08-06 17:18 Zee、阅读(441) 评论(0) 推荐(0)

hdu 1301 Jungle Roads 简单的kruskal

摘要：Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2768Accepted Submission(s): 1944Problem DescriptionThe Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages 阅读全文

posted @ 2012-08-06 10:03 Zee、阅读(273) 评论(0) 推荐(0)

hdu 1875 畅通工程再续最小生成树

摘要：畅通工程再续Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7266Accepted Submission(s): 2185Problem Description相信大家都听说一个“百岛湖”的地方吧，百岛湖的居民生活在不同的小岛中，当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖，发展首先要解决的问题当然是交通问题，政府决定实现百岛湖的全畅通！经过考察小组RPRush对百岛湖的情况充分了解后，决定在符合条件的小岛间建上桥，阅读全文

posted @ 2012-08-05 15:05 Zee、阅读(191) 评论(0) 推荐(0)

hdu 1863 畅通工程最小生成树+并查集

摘要：畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 9798Accepted Submission(s): 3851Problem Description省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。经过调查评估，得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序，计算出全省畅通需要的最低成本。Input测试输入包含若干测试用例。每个测试用例的第1 阅读全文

posted @ 2012-08-05 10:40 Zee、阅读(291) 评论(0) 推荐(0)

最小生成树 kruskal 和 pime 模版

摘要：kruskal：View Code 1 #include <iostream> 2 #define INF 0x3fff 3 #define MAXN 100 4 using namespace std; 5 typedef struct 6 { 7 int s;//start结点 8 int e;//end结点 9 int w;//weight权值 10 }edge; 11 edge e[MAXN*MAXN/2];//存储每一条边的数组 12 void insertsort(edge e[],int n)//直接插入排序 13 { 14 ... 阅读全文

posted @ 2012-08-05 09:23 Zee、阅读(331) 评论(0) 推荐(0)

hdu 2680 Choose the best route Dijkstra 虚拟点

摘要：Choose the best routeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3608Accepted Submission(s): 1143Problem DescriptionOne day , Kiki wants to visit one of her friends. As she is liable to carsickness , she wants to arrive at her friend’s home as 阅读全文

posted @ 2012-08-04 11:08 Zee、阅读(190) 评论(0) 推荐(0)

hdu 1285 确定比赛名次拓扑排序

摘要：确定比赛名次Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 5Accepted Submission(s) : 2Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description有N个比赛队（1<=N<=500），编号依次为1，2，3，。。。。，N进行比赛，比赛结束后，裁判委员会要将所有参赛队伍从前往后依次排名，但现在裁判委员会不能直接获得每个队的比赛成绩，只知道每阅读全文

posted @ 2012-08-03 16:48 Zee、阅读(178) 评论(0) 推荐(0)

hdu 3342 Legal or Not 拓排序

摘要：Legal or NotProblem DescriptionACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many "holy cows" like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When someone has questions, ma 阅读全文

posted @ 2012-08-03 16:09 Zee、阅读(583) 评论(0) 推荐(0)

hdu 1874 畅通工程续 Dijkstra

摘要：畅通工程续Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13088Accepted Submission(s): 4448Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。Input本题目包含多阅读全文

posted @ 2012-08-03 15:28 Zee、阅读(209) 评论(0) 推荐(0)

hdu 1596 find the safest road Dijkstra

摘要：find the safest roadTime Limit : 10000/5000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 3Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionXX星球有很多城市，每个城市之间有一条或多条飞行通道，但是并不是所有的路都是很安全的，每一条路有一个安全系数s,s是在 0 和 1 间的实数(包括0，1)，一条从u 到 v 阅读全文

posted @ 2012-08-02 10:31 Zee、阅读(251) 评论(0) 推荐(0)

poj 2387 Dijkstra 模板

摘要：Til the Cows Come HomeTime Limit:1000MSMemory Limit:65536KTotal Submissions:21209Accepted:7062DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to 阅读全文

posted @ 2012-08-02 09:23 Zee、阅读(402) 评论(0) 推荐(0)

随笔分类 - 图论