
图论
文章平均质量分 85
旻宇
New Acmer
展开
-
POJ1274 The Perfect Stall
原题链接: http://poj.org/problem?id=1274原创 2014-06-04 23:15:32 · 476 阅读 · 0 评论 -
POJ1776 Task Sequences
URL:http://poj.org/problem?id=1776DescriptionTom has received a lot of tasks from his boss, which are boring to deal with by hand. Fortunately,Tom got a special machine - Advanced Computing Mach原创 2015-08-18 21:31:11 · 760 阅读 · 0 评论 -
uva216 Getting in Line
Computer networking requires that the computers in the network be linked.This problem considers a ``linear" network in which the computers are chained together so that each is connected to exactly t原创 2015-08-18 20:23:52 · 463 阅读 · 0 评论 -
POJ2337/UVA10441 Catenyms
URL:http://poj.org/problem?id=2337URL:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=16&page=show_problem&problem=1382DescriptionA catenym is a pair of words原创 2015-08-18 13:46:37 · 544 阅读 · 0 评论 -
ZOJ1649 Rescue 路径深度图算法
Time Limit: 2 Seconds Memory Limit: 65536 KBAngel was caught by the MOLIGPY! He was put in prison by Moligpy. The prison is described as a N * M (N, M Angel's friends want to save Angel. Th原创 2014-08-11 18:12:05 · 567 阅读 · 0 评论 -
ZOJ2110 Tempter of the Bone
URL:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1110原创 2014-07-28 22:34:32 · 468 阅读 · 0 评论 -
POJ 1659 Frogs' Neighborhood Havel-Hakimi定理
UDescription未名湖附近共有N个大小湖泊L1, L2, ..., Ln(其中包括未名湖),每个湖泊Li里住着一只青蛙Fi(1 ≤ i ≤ N)。如果湖泊Li和Lj之间有水路相连,则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1, x2, ..., xn,请你给出每两个湖泊之间的相连关系。Input第一行是测试数据的组数T(0 ≤ T ≤ 20)。原创 2014-07-27 19:58:34 · 545 阅读 · 0 评论 -
hdu4292 Food 网络最大流 拆点
Problem Description You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. The issue comes up as people in y原创 2014-07-26 17:21:10 · 552 阅读 · 0 评论 -
POJ 3436 ACM Computer Factory
DescriptionAs you know, all the computers used for ACM contests must be identical, so the participants compete on equal terms. That is why all these computers are historically produced at the same原创 2014-07-25 21:29:10 · 518 阅读 · 0 评论 -
POJ1273 Drainage Ditches
DescriptionEvery time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long time to r原创 2014-07-24 13:43:46 · 432 阅读 · 0 评论 -
POJ1459 Power Network
DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce a原创 2014-07-24 22:10:11 · 469 阅读 · 0 评论 -
POJ1149 PIGS 网络最大流
DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each o原创 2014-07-21 21:38:36 · 554 阅读 · 1 评论 -
ZOJ1516 Uncle Tom's Inherited Land
Your old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in the shape of a rectangle. A long time ago, however, his great-great-uncle decided to divid原创 2014-07-18 00:06:01 · 638 阅读 · 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 bo原创 2014-07-17 22:03:55 · 527 阅读 · 0 评论 -
POJ1325 Machine Schedule
Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11506 Accepted: 4893DescriptionAs we all know, machine scheduling is a very classical pr原创 2014-07-17 20:14:46 · 474 阅读 · 0 评论 -
ZOJ 1654 Place the Robots
Place the RobotsTime Limit: 5 Seconds Memory Limit: 32768 KBRobert is a famous engineer. One day he was given a task by his boss. The background of the task was the following:Given a原创 2014-07-17 18:33:33 · 664 阅读 · 0 评论 -
二分图最大匹配
POJ 1274 The Perfect Stall原创 2014-07-17 14:21:37 · 429 阅读 · 0 评论 -
带权二分图最佳匹配KM算法模板
KM算法是在匈牙利算法的基础上扩展出来的,原创 2014-06-05 23:02:38 · 1029 阅读 · 0 评论 -
POJ1419 Graph Coloring
DescriptionYou are to write a program that tries to find an optimal coloring for a given graph. Colors are applied to the nodes of the graph and the only available colors are black and white. The co原创 2015-08-19 17:10:17 · 633 阅读 · 0 评论