摘要：好恶心的题目，题面那么长，害我折腾了几个小时。。。刚开始是在杭电做的这题，打完代码以后交不过，不得已查解题报告，才发现poj上也有这题。看了别人的解题报告之后才发现自己理解错了。于是推倒重来，重新写，可还是不过。问了问金牛，才发现居然还是理解错了题目，晕死啊。。。。最后根据那组数据调了一会儿，就过了。我的做法跟网上别人的做法一样，用的最大流。建图的时候，加一个源点一个汇点，源点连插座，流量为1，插座连电器，流量为1，电器连汇点，流量为1，然后如果插座A能通过适配器转换成插座B，就连A到B，流量无穷大。最大流就是最多能插上的电器数了。/* * hdu1526/win.cpp * Created 阅读全文

摘要：对于每一种颜色的气球都建一次图求最大匹配即可。/* * hdu1498/win.cpp * Created on: 2012-8-16 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <ctime>#include <iostream>#include <algorithm>#include <queue>#include <set>#includ 阅读全文

摘要：直接上代码。/* * hdu1083/win.cpp * Created on: 2012-8-16 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <ctime>#include <iostream>#include <algorithm>#include <queue>#include <set>#include <map>#inc 阅读全文

摘要：一开始为建图纠结了半天，后来看了解题报告才突然明白，直接按输入建成的图，其最大匹配数为实际的图的2倍。。。/* * hdu1068/win.cpp * Created on: 2012-8-15 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <ctime>#include <iostream>#include <algorithm>#include <queue& 阅读全文

摘要：这题先用邻接矩阵打了试，TLE，改成邻接表，就过了。。/* * hdu1054/win.cpp * Created on: 2012-8-14 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <ctime>#include <iostream>#include <algorithm>#include <queue>#include <set>#in 阅读全文

摘要：连着做两道最小点集覆盖的题，直接拿上一题代码改的，都没改几句。。/* * 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 阅读全文

摘要：参考网上大牛的方法做的，A了，但做法的可行性我还没有想明白。慢慢再想吧，先贴代码~/* * hdu1569/win.cpp * Created on: 2011-10-5 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>#include <iostream>#include <queue>using namespace std;typedef int 阅读全文

摘要：一看就是网络流，直接上Dinic模板，交上，RE，把MAXM改成500，过了，对出题者无语！/* * hdu1532/win.cpp * Created on: 2011-10-5 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>#include <iostream>#include <queue>using namespace std;typede 阅读全文

摘要：题目没啥说的，赤裸裸的匈牙利算法，可恶的是题目输入描述不清，还以为每组输入后都有一个0呢，害得我RE了一次，鄙视一下出题者，哈哈！/* * hdu2063/linux.cpp * Created on: 2011-9-1 * Author : ben */#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <algorithm>usingnamespace std;constint MAXN =555;int n, m, match 阅读全文