Online JudgeProblem SetAuthorsOnline ContestsUser
Web Board
Home Page
F.A.Qs
Statistical Charts
Problems
Submit Problem
Online Status
Prob.ID:
Register
Update your info
Authors ranklist
Current Contest
Past Contests
Scheduled Contests
Award Contest
User ID:
Password:
  Register

代码!

Posted by chenxuan123456789 at 2012-07-28 13:11:47 on Problem 1258
#include <stdio.h>
#include <string.h>
#define N 100+10
#define INF 9999999
int road[N][N];
int city[N];
int s[N];
int main()
{
	int i,j,n,rec,max,sum;

	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
	{
		getchar();
		for(j=1;j<=n;j++)
			scanf("%d",&road[i][j]);
	}
	memset(s,0,sizeof(s));
	for(i=1;i<=n;i++)
	city[i]=road[1][i];
	s[1]=1;
	sum=0;
	for(i=1;i<n;i++)
	{
		max=INF;
		for(j=1;j<=n;j++)
         if(!s[j]&&city[j]<max)
		 {
			 max=city[j];
			 rec=j;
		 }
		 s[rec]=1;
		 sum+=city[rec];
		 for(j=1;j<=n;j++)
			 if(!s[j]&&road[rec][j]<city[j])
				 city[j]=road[rec][j];
			 }
	printf("%d\n",sum);
	}
	return 1;
}

Followed by:

Post your reply here:
User ID:
Password:
Title:

Content:

Home Page   Go Back  To top


All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator