摘要：（1）飞行员配对方案问题：二分图最大匹配。思路：略。View Code 1 #include<cstdio> 2 #include<cstring> 3 #define MAXN 1010 4 int cx[MAXN], cy[MAXN]; 5 int first[MAXN], next[MAXN], v[MAXN], e; 6 bool vis[MAXN]; 7 inline void addEdge(int x, int y) { 8 v[e] = y; 9 next[e] = first[x];10 first[x] = e++;11 }12 int path(. 阅读全文