不知妖精

摘要： Problem Description有N个比赛队（1using namespace std;#include #include const maxn=550;int map[maxn][maxn];int in[maxn];int used[maxn];queue Q;void topol(int N,int M){ memset(map,0,sizeof(map)); memset(in,0,sizeof(in)); memset(used,0,sizeof(used)); int i,j; int a,b; int t; for (i=1;i>a... 阅读全文