poj 1797 最短路变形应用

不能把最短路dist设置为graph[i][j]，WA了好多次

在prim基础上修改的

#include <iostream>
#include <vector>
#include <map>
#include <list>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <cstring>
#include <queue>
using namespace std;

///
///宏定义
const int  INF = 10000000;
const int MAXN = 1030;
const int maxn = MAXN;
int max(int a, int b)
{ 
	return a > b ? a : b;
}
int min(int a, int b)
{
	return a < b ? a : b;
}

int n, m;
int k;
int graph[MAXN][MAXN];
bool vis[MAXN];
int dist[MAXN];
int prim()
{
	int i, j;
	int u = 1;
	memset(vis, false, sizeof(vis));
	for (i = 1; i <= n; ++i)
	{
		dist[i] = graph[1][i];
	}
	vis[1] = true;
	int sum = 0;
	dist[1] = 0;

	//搜索最小边
	for (i = 0; i < n - 1; ++i)
	{
		int temp = INF;
		//从当前结点出发
		for (j = 1; j <= n; ++j)
		{
			if (!vis[j] && dist[j] < temp)
			{
				temp = dist[j];
				u = j;
			}
		}

		vis[u] = true;
		sum += temp;

		//更新dist数组
		for (j = 1; j <= n; ++j)
		{
			if (!vis[j] && graph[u][j] < dist[j])
			{
				dist[j] = graph[u][j];
			}
		}
	}
	
	return sum;
}
void dij()
{
	int i, j;
	int cur = 1;
	int u = 1;
	memset(vis, false, sizeof(vis));
	memset(dist, 0, sizeof(dist));
	/*   dist数组初始要设置为0 ~~~
	for (i = 1; i <= n; ++i)
	{
		dist[i] = graph[1][i];
	}
	*/
	vis[cur] = true;
	dist[cur] = INF;


	for (i = 0; i < n - 1; ++i)
	{
		int temp = 0;
		//更新dist数组
		for (j = 2; j <= n; ++j)
		{
			if (!vis[j])
			{
				if (graph[cur][j] != INF && dist[j] < min(dist[cur], graph[cur][j])) 
				{
					//				dist[j] = dist[u] + graph[u][j];
					dist[j] = min(dist[cur], graph[cur][j]);
				}
				if (temp < dist[j])
				{
					temp = dist[j];
					u = j;
				}
			}
		}
		if (temp == 0)
		{
			break;
		}
		vis[u] = true;
		cur = u;
		/*
		//从当前结点出发，选择最大的边
		for (j = 1; j <= n; ++j)
		{
			if (graph[cur][j] != INF)
			{
				if (!vis[j] && dist[j] > temp)
				{
					temp = dist[j];
					u = j;
				}

			}

		}
		vis[u] = true;


		cur = u;
		*/
	}
//	return minlen;
}
int main()
{
	///
	int i, j;
	int ncases;
	scanf("%d", &ncases);
	int cases = 1;
	while (ncases--)
	{
		scanf("%d%d", &n, &m);
		for (i = 0; i <= n; ++i)
		{
			for (j = 0; j <= n; ++j)
			{
				graph[i][j] = INF;
			}
		}
		for (j = 0; j < m; ++j)
		{
			int from, to, dists;
			scanf("%d%d%d", &from, &to, &dists);
			graph[from][to] = graph[to][from] = dists;
		}

//		int ans = prim();
		dij();
		int ans = dist[n];
		printf("Scenario #%d:\n", cases);
		cases++;
		printf("%d\n\n", ans);
	}

	///
	return 0;
}