摘要： #include<iostream>#include<queue>#include<algorithm>#include<cstring>using namespace std;int n,g[101][101],d[101];const int INF=10000000;int broken;int spfa(int x){ queue <int > q; q.push(x); bool inq[101]; memset(inq,0,sizeof(inq)); for(int i=1;i<=n;i++)d[i]=(i==x?0 阅读全文