摘要： 关于拓扑排序特意找了个简单的做，呵呵。。。View Code #include <stdio.h>#include <string.h>#include <iostream>using namespace std;int a[551][501],ru[551];int main(){ int n,m,i,q1,q2,z,j,k; while(scanf("%d%d",&n,&m)!=EOF) { z=0; memset(a,0,sizeof(a)); memset(ru,0,sizeof(ru)); for(i=1; i. 阅读全文

摘要： View Code /*5001001000001001111011100050111100000010000110001110*/#include<iostream>#include<cstdio>using namespace std;#define N 2010int indegree[N],a[N][N];char b[N];int main(){// freopen("in.txt","r",stdin); int n,t,x,p=1; scanf("%d",&t); while(t--){ 阅读全文