mhlwsk的博客

行染色条->列染色条 代表一个能放的点。可以用二分图匹配做。 网络流做法#include <cstdio> #include <algorithm> #include <cstring> #include <queue> using namespace std; const int N=2509,M=7509*2,inf=0x7fffffff; int head[N],d[N],edge[M],v

Description As 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 o

题目来源：http://www.lydsy.com/JudgeOnline/problem.php?id=1143 一种理解（引用自http://www.cnblogs.com/BLADEVIL/p/3713043.html）： 　　我们可以将一个点拆成两个点x,y，那么如果存在一条i->j的路径，我们就连接xi,yj，那么答案就是n-最大匹配数。 　　因为i->j所以对于i与j只能