DFS与最大匹配
摘要：
其实就是个DFS。题目：http://acm.swust.edu.cn/oj/problem/0827/View Code #include "iostream"#include "string"#include "cstring"#include "algorithm"using namespace std;#define maxn 105#define INF 0xFFFFFFFint map[maxn][maxn], mid, k, N, M;int Link[maxn]; //记录行的状态int used[ 阅读全文
posted @ 2012-03-22 19:28 More study needed. 阅读(205) 评论(0) 推荐(0) 编辑
