摘要:
View Code #include<stdio.h>#include<string.h>bool map[505][505];int men[505];bool hash[505];int m;bool dfs(int x){ int i; for(i=1;i<=m;i++) { if(map[x][i]==0||hash[i]) continue; hash[i]=1; if(men[i]==0||dfs(men[i])) { men[i]=x; return 1; } } return 0;}int main(){ int i,g,k; int count; 阅读全文
posted @ 2011-07-19 15:02 huhuuu 阅读(222) 评论(0) 推荐(0) 编辑