qq_44866969的博客

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N=1010,M=N*N,K=2*N*N;int p[M],g[N][N],n,m,cnt;struct node{ int a,b,dist;}edges[K];int find(int x){ if(p[x]!=x)return p[x]=find(p[x]); .

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N=2010,M=10010;int p[N],n,m;int find(int x){ if(p[x]!=x)p[x]=find(p[x]); return p[x];}struct node{ int a,b,dist; bool operator&l.

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N=310,M=10000;int p[N],n,m;int find(int x){ if(p[x]!=x)p[x]=find(p[x]); return p[x];}struct node{ int a,b,dist; bool operator<.

#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int N=110,M=210,inf=0x3f3f3f3f;struct node{ int a,b,dist; bool operator<(const node &a)const { return dist<a.dist; }}.

#include<iostream>#include<cstring>using namespace std;const int N=110;int dist[N],n,m;int g[N][N];bool st[N];int prim(){ int res=0; memset(dist,0x3f,sizeof dist); for(int i=1;i<=n;i++) dist[i]=g[1][i]; st[1]=true; for(int i=.