moonbay

摘要： 连着做两道最小点集覆盖的题，直接拿上一题代码改的，都没改几句。。/* * hdu1150/win.cpp * Created on: 2012-8-14 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 210;int N, M, mymatch[MAXN];bool visited[MAXN], my 阅读全文

摘要： 用匈牙利就行，比较赤裸。/* * hdu2119/win.cpp * Created on: 2012-8-13 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 210;int N, M, mymatch[MAXN];bool visited[MAXN], mymap[MAXN][MAXN];bool 阅读全文