摘要：
http://poj.org/problem?id=3041View Code #include <iostream>#include <cstdio>#include <cstring>using namespace std;int map[510][510] = {0};int match[510] = {0};int value[510] = {0};int n = 0;int m = 0;int x = 0;int y = 0;int find(int q){ for(int i = 1;i <= n; ++i) { if(value[i] = 阅读全文
