HDU 1874 (最短路--Floyd算法)

 

WA代码:

#include <cstdio>
#define max 201
#define INF 0xfffffff
int dist[max][max],n;
void Floyd ()
{
	for (int k=0;k<n;k++)
		for (int i=0;i<n;i++)
			for (int j=0;j<n;j++)
				if (dist[i][j] > dist[i][k]+dist[k][j])
					dist[i][j] = dist[i][k]+dist[k][j];
}
void init ()
{
	for (int i=0;i<n-1;i++)
		for (int j=i+1;j<n;j++)
			dist[i][j] = dist[j][i] = INF;

	for (int i=0;i<n;i++)
		dist[i][i] = 0;
}
int main ()
{
	int m;
	while (~scanf ("%d%d",&n,&m))
	{
		int a,b,c;
		init ();
		while (m--)
		{
			scanf ("%d%d%d",&a,&b,&c);
			dist[a][b] = dist[b][a] = c;
		}
		scanf ("%d%d",&a,&b);
		c = -1;
		Floyd ();
		printf ("%d\n",dist[a][b]!=INF?dist[a][b]:c);
	}
	return 0;
}

AC代码:

#include <cstdio>
#define max 201
#define INF 0xfffffff
int dist[max][max],n;
void Floyd ()
{
	for (int k=0;k<n;k++)
		for (int i=0;i<n;i++)
			for (int j=0;j<n;j++)
				if (dist[i][j] > dist[i][k]+dist[k][j])
					dist[i][j] = dist[i][k]+dist[k][j];
}
void init ()
{
	for (int i=0;i<n-1;i++)
		for (int j=i+1;j<n;j++)
			dist[i][j] = dist[j][i] = INF;

	for (int i=0;i<n;i++)
		dist[i][i] = 0;
}
int main ()
{
	int m;
	while (~scanf ("%d%d",&n,&m))
	{
		int a,b,c;
		init ();
		while (m--)
		{
			scanf ("%d%d%d",&a,&b,&c);
			if (dist[a][b] > c)    //不明白的地方,也是出错的地方.
			dist[a][b] = dist[b][a] = c;
		}
		scanf ("%d%d",&a,&b);
		c = -1;
		Floyd ();
		printf ("%d\n",dist[a][b]!=INF?dist[a][b]:c);
	}
	return 0;
}

 Dijkstra 算法代码：比算法用时 46MS 还高 32MS。。。。

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define max 205
#define INF 0xfffffff
int map[max][max],dist[max],m,n;
bool visited[max];
void Dijkstra (int s)
{
    int k;
    memset (visited,0,sizeof visited);
    for (int i=0; i<n; i++)
        dist[i] = map[s][i];
    visited[s] = true;
    for (int i=0; i<n; i++)
    {
        int min = INF;
        for (int j=0; j<n; j++)
            if (!visited[j] && dist[j] < min)
                min = dist[k=j];

        visited[k] = true;
        for (int j=0; j<n; j++)
        {
            if (!visited[j] && map[k][j]!=INF)
            {
                int tmp = dist[k] + map[k][j];
                if (tmp < dist[j])
                    dist[j] = tmp;
            }
        }
    }
}
void init ()
{
    for (int i=0; i<n-1; i++)
        for (int j=i+1; j<n; j++)
            map[i][j] = map[j][i] = INF;
    for (int i=0; i<n; i++)
        map[i][i] = 0;
}
int main ()
{
#ifndef ONLINE_JUDGE
    freopen ("in.txt","r",stdin);
#endif
    while (cin >>n >>m)
    {
        int a,b,c;
        init ();
        while (m--)
        {
            cin >>a >>b >>c;
            if (map[a][b] > c)
            map[a][b] = map[b][a] = c;
        }
        cin >>a >>b;
        Dijkstra (a);
        if (dist[b] != INF)
            cout << dist[b] << endl;
        else
            cout << "-1\n";
    }
    return 0;
}