Jack Ge for ACM

摘要： 网络流题目集锦(转)最大流POJ 1273 Drainage DitchesPOJ 1274 The Perfect Stall (二分图匹配)POJ 1698 Alice's ChancePOJ 1459 Power NetworkPOJ 2112 Optimal Milking (二分)POJ 2455 Secret Milking Machine (二分)POJ 3189 Steady Cow Assignment (枚举)POJ 1637 Sightseeing tour (混合图欧拉回路)POJ 3498 March of the Penguins (枚举汇点)POJ 108 阅读全文

摘要： CandiesTime Limit:1500MSMemory Limit:131072KTotal Submissions:19891Accepted:5241DescriptionDuring the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class a large bag of candies and had flymouse distribute them. All the kids lov 阅读全文

摘要： LayoutTime Limit:1000MSMemory Limit:65536KTotal Submissions:5190Accepted:2491DescriptionLike everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 <= N <= 1,000) cows numbered 1..N standing along a straight line waiting for feed. The cows are standing in t 阅读全文

摘要： 找了好久终于在这个牛这里找到为什么反向边要加回流量的原因了，因为是初学教程，所以我会尽量避免繁杂的数学公式和证明。也尽量给出了较为完整的代码。本文的目标群体是网络流的初学者，尤其是看了各种NB的教程也没看懂怎么求最大流的小盆友们。本文的目的是，解释基本的网络流模型，最基础的最大流求法，即bfs找增广路法，也就是EK法，全名是Edmond-Karp，其实我倒是觉得记一下算法的全名和来历可以不时的拿出来装一装。 比如说这个，EK算法首先由俄罗斯科学家Dinic在1970年提出，没错，就是dinic算法的创始人，实际上他提出的也正是dinic算法，在EK的基础上加入了层次优化，这个我们以后再说，19 阅读全文

摘要： KingTime Limit:1000MSMemory Limit:10000KTotal Submissions:8534Accepted:3221DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, sh 阅读全文

摘要： Flow ProblemTime Limit: 5000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4865Accepted Submission(s): 2275Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted dire 阅读全文

摘要： Minimum CutTime Limit:10000MSMemory Limit:65536KTotal Submissions:6403Accepted:2663Case Time Limit:5000MSDescriptionGiven an undirected graph, in which two vertices can be connected by multiple edges, what is the size of the minimum cut of the graph? i.e. how many edges must be removed at least to d 阅读全文

摘要： 1461.致命游戏http://acm.xmu.edu.cn/JudgeOnline/problem.php?id=1461Time Limit: 3000 MSMemory Limit: 65536 KTotal Submissions: 84 (53 users)Accepted: 35 (35 users)[My Solution]Description 程序员Alice和Bob摊上大事了，被判了死刑。恰巧这天遇上“网宿科技杯”厦门大学第四届程序设计积分赛，于是主办方决定大赦其中一个人的刑罚。 主办方开发了一个游戏：有一个n*m大小的矩形格子阵列，左下角为(1, 1)格子，放了瓶毒药。A 阅读全文

摘要： Computer Virus on Planet PandoraTime Limit : 6000/2000ms (Java/Other)Memory Limit : 256000/128000K (Java/Other)Total Submission(s) : 12Accepted Submission(s) : 5Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionAliens on planet Pandora also write computer programs like us. Their pro 阅读全文

摘要： Dual Core CPUTime Limit:15000MSMemory Limit:131072KTotal Submissions:15782Accepted:6813Case Time Limit:5000MSDescriptionAs more and more computers are equipped with dual core CPU, SetagLilb, the Chief Technology Officer of TinySoft Corporation, decided to update their famous product - SWODNIW.The ro 阅读全文