![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
匹配图
BYSora
这个作者很懒,什么都没留下…
展开
-
hdu3488——Tour(有向环覆盖,二分图最佳匹配)
Problem Description In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom原创 2016-10-12 18:55:17 · 449 阅读 · 0 评论 -
poj1466——Girls and Boys(最大独立点集)
DescriptionIn the second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. Fo原创 2016-05-06 10:32:11 · 887 阅读 · 0 评论 -
poj3690——Kindergarten(最大独立点集,匈牙利算法)
DescriptionIn a kindergarten, there are a lot of kids. All girls of the kids know each other and all boys also know each other. In addition to that, some girls and boys know each other. Now the teacher原创 2016-05-06 10:05:25 · 1529 阅读 · 0 评论 -
HDU1056 Tree Cutting(最小点覆盖)
DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must d原创 2016-03-18 19:26:34 · 678 阅读 · 0 评论 -
poj1274——The Perfect Stall(匈牙利算法)
DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering problems, all the stalls in the new barn are different.原创 2016-01-31 18:57:18 · 896 阅读 · 0 评论 -
poj2239——Selecting Courses(二分图匹配)
DescriptionIt is well known that it is not easy to select courses in the college, for there is usually conflict among the time of the courses. Li Ming is a student who loves study every much, and at th原创 2016-01-29 17:25:19 · 835 阅读 · 0 评论 -
POJ1422——Air Raid(二分图,最小路径覆盖)
DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's原创 2015-11-29 10:54:52 · 380 阅读 · 0 评论 -
HDU2063——过山车(二分图,匈牙利算法2)
DescriptionRPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子原创 2015-11-29 10:41:47 · 469 阅读 · 0 评论 -
poj3041——Asteroids(二分图,匈牙利算法)
DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which are conv原创 2015-11-29 10:38:20 · 433 阅读 · 0 评论 -
hdu3605——Escape(二分图多重匹配)
Problem Description 2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the plane原创 2016-11-14 21:38:30 · 741 阅读 · 0 评论 -
poj1325——Machine Schedule(最小顶点覆盖)
DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of the constr原创 2016-05-06 11:07:20 · 1030 阅读 · 0 评论 -
poj2060——Taxi Cab Scheme(最小路径覆盖)
DescriptionRunning a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as soon as poss原创 2016-05-06 14:27:35 · 1103 阅读 · 0 评论 -
hdu2255——奔小康赚大钱(二分图最优匹配+KM算法)
Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百姓原创 2016-10-10 19:34:59 · 438 阅读 · 0 评论 -
hdu3829——Cat VS Dog(最大独立集)
Problem Description The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child’s like-animal is a cat, then his/hers d原创 2016-10-09 20:39:44 · 349 阅读 · 0 评论 -
hdu1054——Strategic Game(最小顶点覆盖+邻接表)
Problem Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He m原创 2016-10-09 19:51:19 · 529 阅读 · 0 评论 -
hdu1151——Air Raid(最小路径覆盖)
Problem Description Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through to原创 2016-10-09 18:51:43 · 352 阅读 · 0 评论 -
poj3020——Antenna Placement(最小边覆盖)
DescriptionThe Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their discover原创 2016-10-08 20:41:17 · 687 阅读 · 0 评论 -
poj2594——Treasure Exploration(闭包+最小路径覆盖)
DescriptionHave you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, you would原创 2016-10-08 19:14:04 · 553 阅读 · 0 评论 -
hdu1083——Courses(匈牙利算法)
Problem Description Consider 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 exactl原创 2016-09-28 20:00:39 · 684 阅读 · 0 评论 -
hdu2444——The Accomodation of Students(判断二分图+匈牙利算法)
Problem Description There are a group of students. Some of them may know each other, while others don’t. For example, A and B know each other, B and C know each other. But this may not imply that A an原创 2016-09-28 19:12:25 · 1127 阅读 · 1 评论 -
hdu1045——Fire Net(二分图+行列匹配)
Problem Description Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall. A blockhouse i原创 2016-09-28 18:38:05 · 709 阅读 · 0 评论 -
hdu5917——Wrestling Match(二分图染色)
Problem Description Nowadays, at least one wrestling match is held every year in our country. There are a lot of people in the game is “good player”, the rest is “bad player”. Now, Xiao Ming is refere原创 2017-05-02 11:22:44 · 1387 阅读 · 0 评论