1436 Renting Boats（floyd，Dijkstra应用）

Problem Description

Yangtse Rive Barge Club has set up n barge hiring stops numbered 1, 2, … , n along the Changjiang River. Passengers can hire barges from any of these stops, and return the barges to one of the stops afterward. The rent for an barge from stop i to stop j is r(i,j) (1<=i,j<=n). Your task is to design an algorithm to minimize the rent of hiring barges when you traveling from stop 1 to stop n.

Input

There are multiple test cases. The first line of each case contains an integer n indicating the number of the stops (n<=200). The following n-1 lines are the rent between any two stops. The ith following line contains n-i integers indicating r(i,j) (i < j <= n).

Output

For each case, output one line representing the minimal rent.

Sample Input

3
5 15
7

Sample Output

12
#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;

const int maxsize=200;
int len[maxsize][maxsize];

void floyd(int n)
{
	int i,j,k;
	for(k=0;k<n;k++)
		for(i=0;i<n;i++)
		{
			if(len[i][k]>0)
			{
				for(j=0;j<n;j++)
					{
						if(len[i][j]>0)
						{
							if(len[i][j]>(len[i][k]+len[k][j]))
								len[i][j]=len[i][k]+len[k][j];
						}
					}
			}
		}
}
int main()
{
//	freopen("e://test.txt","r",stdin);
	int n,val,i,j;
	while(scanf("%d",&n)!=EOF)
	{	
		memset(len,0,sizeof(len));
		for(i=0;i<n-1;i++)
		{
			for(j=i+1;j<n;j++)
			{
				scanf("%d",&val);
				len[i][j]=val;
			}
		}
		floyd(n);
/*		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
				cout<<len[i][j]<<" ";
			cout<<endl;
		}
*/
		cout<<len[0][n-1]<<endl;
	}
	return 0;
}
 

 上面贴的没有初始化为无穷，不科学，但可以通过，下面的标准点：

#include<iostream>
#include<stdio.h>
#include<string>
using namespace std;

const int limt=10000;
const int maxsize=200;
int len[maxsize][maxsize];

void floyd(int n)
{
	int i,j,k;
	for(k=0;k<n;k++)
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				if(len[i][j]>(len[i][k]+len[k][j]))
					len[i][j]=len[i][k]+len[k][j];
}

int main()
{
	freopen("e://test.txt","r",stdin);
	int n,val,i,j;
	while(scanf("%d",&n)!=EOF)
	{	
		memset(len,limt,sizeof(len));//一定要初始化无穷
		for(i=0;i<n;i++)
			for(j=0;j<n;j++)
				if(i=j)
					len[i][j]=0;//使对角线上为零
		for(i=0;i<n-1;i++)
		{
			for(j=i+1;j<n;j++)
			{
				scanf("%d",&val);
				len[i][j]=val;
			}
		}
		floyd(n);
/*		for(i=0;i<n;i++)
		{
			for(j=0;j<n;j++)
				cout<<len[i][j]<<" ";
			cout<<endl;
		}
*/
		cout<<len[0][n-1]<<endl;
	}
	return 0;
}
 

下面的代码是用Dijkstra做的

#include <stdio.h>
#include <string.h>
#define MAX 205
#define INFINITE 99999

int Dijkstra(int Graph[][MAX], int n)
{
	int Set[MAX];
	int dist[MAX];
	memset(Set, 0, sizeof(Set));
	int i,j,k;
	int min;
	for (i=1;i<=n;i++)
	{
		dist[i] = Graph[1][i];
		if (dist[i] != INFINITE)
			Set[i] = 1;
	}
	
	for (j=2;j<=n;j++)
	{
		min = INFINITE;
		for (i=2;i<=n;i++)
			if (Set[i]==1&&dist[i]<min)
			{
				min = dist[i];
				k = i;
			}
		Set[k] = 2;
		for (i=2;i<=n;i++)
			if (Graph[k][i]!=INFINITE&&(Set[i]==0||dist[i]>Graph[k][i]+dist[k]))
			{
				dist[i] = dist[k]+Graph[k][i];
				if (Set[i] == 0)
					Set[i] = 1;
			}
	}
	return dist[n];
}

int main()
{
	freopen("e://test.txt","r",stdin);
	int n;
	int i,j;
	int Graph[MAX][MAX];
	while(scanf("%d", &n)!=EOF)
	{
		for (i=1;i<=n;i++)
			for (j=1;j<=n;j++)
				if (i==j)
					Graph[i][j] = 0;
				else 
					Graph[i][j] = INFINITE;
		for (i=1;i<n;i++)
			for (j=i+1;j<=n;j++)
				scanf("%d", &Graph[i][j]);
		printf("%d/n", Dijkstra(Graph, n));
	}
	return 0;
}