Agri-Net

#include<fstream>
#include<iostream>
using namespace std;
ifstream fin ("agrinet.in");
ofstream fout ("agrinet.out");
int main()
{
	int i,j,n;
	int p[101][101];
	int sign[101];
	int sum=0;
	int t=1;
	for(i=1;i<=100;i++)
		sign[i]=0;//标志i牧场是否已访问，初始都未访问
	fin>>n;
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			p[i][j]=100001;
		}
	}//每个牧场初始化不连接，距离为100001
	for(i=1;i<=n;i++)
	{
		for(j=1;j<=n;j++)
		{
			fin>>p[i][j];
		}
	}
	for(int s=1;s<=n-1;s++)//遍历n-1次
	{
		int dist=100001;
		int k,l;
		//每次找到最小的未访问的距离
	    for(i=1;i<=n;i++)
	    {
		    for(j=1;j<=n;j++)
		    {
			    if(i!=j && ((!sign[i] || !sign[j])||(sign[i]!=sign[j])) && p[i][j]<dist)
			    {
				    dist=p[i][j];
					k=i;
					l=j;
			    }
		    }
	    }
		if(sign[k]==0 && sign[l]==0)
		{
			sign[k]=t;
			sign[l]=t;
			t++;
		}
		if(sign[k]==0 && sign[l]!=0)
			sign[k]=sign[l];
		if(sign[k]!=0 && sign[l]==0)
			sign[l]=sign[k];
		if(sign[k]!=sign[l])
		{
			int temp=sign[k];
			for(i=1;i<=n;i++)
			{
				if(sign[i]==temp)
					sign[i]=sign[l];
			}
		}
		//cout<<"k:"<<k<<" "<<"l:"<<l<<" "<<"dist:"<<dist<<endl;
		//for(i=1;i<=n;i++)
			//cout<<sign[i]<<" ";
		//cout<<endl;
		//cout<<"-----------------------"<<endl;
		sum+=dist;
	}
	fout<<sum<<endl;
	return 0;
}