HDU 1150 Machine Schedule匈牙利算法
http://blog.csdn.net/dark_scope/article/details/8880547
#include
#include
#define maxn 105
int g[maxn][maxn], use[maxn], n, m, k, res;
bool vis[maxn];
int dfs(int x)
{
for(int i = 0;i < m;i
原创
2015-09-10 13:35:58 ·
436 阅读 ·
0 评论