无向图最小环 Timus1004. Sightseeing Trip

题目链接：Timus 1004

1004. Sightseeing Trip Time limit: 0.5 second Memory limit: 64 MB There is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attractions, sightseeing the town. To earn as much as possible from this attraction, the agency has accepted a shrewd decision: it is necessary to find the shortest route which begins and ends at the same place. Your task is to write a program which finds such a route. In the town there are  N crossing points numbered from 1 to  N and  M two-way roads numbered from 1 to  M. Two crossing points can be connected by multiple roads, but no road connects a crossing point with itself. Each sightseeing route is a sequence of road numbers  y 1, …,  yk,  k > 2. The road  yi  (1 ≤  i ≤  k − 1)  connects crossing points xi and  x i+1, the road  yk connects crossing points  xk and  x 1. All the numbers  x 1, …,  xk should be different. The length of the sightseeing route is the sum of the lengths of all roads on the sightseeing route, i.e. L( y 1) + L( y 2) + … + L( yk) where L( yi) is the length of the road  yi (1 ≤  i≤  k). Your program has to find such a sightseeing route, the length of which is minimal, or to specify that it is not possible, because there is no sightseeing route in the town. Input Input contains  T tests (1 ≤  T ≤ 5). The first line of each test contains two integers: the number of crossing points  N and the number of roads  M (3 ≤  N ≤ 100; 3 ≤  M ≤  N · ( N − 1)). Each of the next  M lines describes one road. It contains 3 integers: the number of its first crossing point  a, the number of the second one  b, and the length of the road  l (1 ≤  a,  b ≤  N;  a ≠  b; 1 ≤  l ≤ 300 ). Input is ended with a “−1” line. Output Each line of output is an answer. It contains either a string “No solution.” in case there isn't any sightseeing route, or it contains the numbers of all crossing points on the shortest sightseeing route in the order how to pass them (i.e. the numbers  x 1 to  xk from our definition of a sightseeing route), separated by single spaces. If there are multiple sightseeing routes of the minimal length, you can output any one of them. Sample input output 5 7 1 4 1 1 3 300 3 1 10 1 2 16 2 3 100 2 5 15 5 3 20 4 3 1 2 10 1 3 20 1 4 30 -1 1 3 5 2 No solution.

floyd变形，fuck，开始时把inf赋值为0x3f3f3f3f，然后wa了，然后我就debug了两个钟，操！！！

源代码：

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

const int inf = 10000000;
const int maxn = 100 + 5;
int g[maxn][maxn];
int dis[maxn][maxn];
int route[maxn];
int pre[maxn][maxn];
int len;

int main()
{
	int n, m, u, v, w;
	while (scanf("%d%d", &n, &m) == 2) {
		len = 0;
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j) 
				g[i][j] = inf, dis[j][i] = inf, pre[i][j] = i;
		while (m--) {
			scanf("%d%d%d", &u, &v, &w);
			if (w < g[u][v]) {
				g[u][v] = w;
				g[v][u] = w;
				dis[u][v] = w;
				dis[v][u] = w;
			}
		}
		int re = inf;
		for (int k = 1; k <= n; ++k) {
			for (int i = 1; i < k; ++i)
				for (int j = i + 1; j < k; ++j)
					if ((re > dis[i][j] + g[j][k] + g[k][i])) {
						re = dis[i][j] + g[j][k] + g[k][i];
						int t = j;
						len = 0;
						while (t != i) {
							route[len++] = t;
							t = pre[i][t];
						}
						route[len++] = i;
						route[len++] = k;
					}
			for (int i = 1; i <= n; ++i)
				for (int j = 1; j <= n; ++j)
					if (dis[i][j] > dis[i][k] + dis[k][j]) {
						dis[i][j] = dis[i][k] + dis[k][j];
						pre[i][j] = pre[k][j];
					}

		}

		if (re != inf) {
			printf("%d", route[0]);
			for (int i = 1; i < len; ++i)
				printf(" %d", route[i]);
			printf("\n");
		}
		else
			printf("No solution.\n");
	}
	return 0;
}