ACM,再见！

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=481

http://acm.hdu.edu.cn/showproblem.php?pid=1151Problem DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also know

http://poj.org/problem?id=2195DescriptionOn a grid map there are n little men and n houses. In each unit time, every little man can move one unit step, either horizontally, or vertically, to a

/***************************************************************************************************************************************************KM算法模板C++作用： 求二分图的最佳匹配注意： (1)for (i：1

http://acm.hdu.edu.cn/showproblem.php?pid=4751Problem Description  This year is the 60th anniversary of NJUST, and to make the celebration more colorful, Tom200 is going to invite distin

http://poj.org/problem?id=2771DescriptionFrank N. Stein is a very conservative high-school teacher. He wants to take some of his students on an excursion, but he is afraid that some of them mi

http://acm.hdu.edu.cn/showproblem.php?pid=3829Cat VS DogTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2851    Accepted Submission(s

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3460MissileTime Limit: 2 Seconds      Memory Limit: 65536 KBYou control N missile launching towers. Every tower has enough mi

http://acm.hdu.edu.cn/showproblem.php?pid=5093Problem DescriptionDear contestant, now you are an excellent navy commander, who is responsible of a tough mission currently.Your fleet unfo

http://poj.org/problem?id=1904DescriptionOnce upon a time there lived a king and he had N sons. And there were N beautiful girls in the kingdom and the king knew about each of his sons which o

http://www.bnuoj.com/v3/contest_show.php?cid=6865#problem/Hfrog has a permutation \(p(1), p(2), \dots, p(n)\) of \(\{1, 2, \dots, n\}\). She also has \(m_1 + m_2\) records \((a_i, b_i, c_i)\) of

http://acm.hdu.edu.cn/showproblem.php?pid=1045Problem DescriptionSuppose 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 r

http://acm.hdu.edu.cn/showproblem.php?pid=2444Problem DescriptionThere 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

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=474descriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Un

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=630http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=475

【最小边覆盖(原图是二分图)】：在图中找一些边，使之覆盖了图中所有顶点，且任何一个顶点有且只有一条边与之关联。最小边覆盖 = 最大独立集 = |V| - 最大匹配数【最小顶点覆盖】：用最少的点（左右两边集合的点）让每条边都至少和其中一个点关联。

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=482description 在一个有m*n 个方格的棋盘中，每个方格中有一个正整数。现要从方格中取数，使任意2 个数所在方格没有公共边，且取出的数的总和最大。试设计一个满足要求的取数算法。对于给定的方格棋盘，按照取数要求编

http://acm.hdu.edu.cn/showproblem.php?pid=5090Problem DescriptionTom and Jerry are playing a game with tubes and pearls. The rule of the game is:1) Tom and Jerry come up together with a

以前做二分图的题目都是用

http://acm.hdu.edu.cn/showproblem.php?pid=5045Problem DescriptionIn the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours

http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=485description 有n件工作要分配给n个人做。第i 个人做第j 件工作产生的效益为ij c 。试设计一个将n件工作分配给n个人做的分配方案，使产生的总效益最大。 对于给定的n件工作和n个人，计算最优分配方案

http://poj.org/problem?id=1422

http://acm.hdu.edu.cn/showproblem.php?pid=2063

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2378/**Uva11383 二分图的完美匹配（深入理解KM算法）刘汝佳大白书P351 少林决胜*/#include #include #include #include using