2012年8月16日
hdu1498最小点集覆盖
摘要： 对于每一种颜色的气球都建一次图求最大匹配即可。/* * 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 阅读全文
posted @ 2012-08-16 14:56 moonbay 阅读(171) 评论(0) 推荐(0)
hdu1083完备匹配的判定
摘要： 直接上代码。/* * 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 阅读全文
posted @ 2012-08-16 11:44 moonbay 阅读(1328) 评论(0) 推荐(0)