ZOJ 1857 最短路

输入有点坑，最后一个case没有空行

#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <string>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

typedef  long long LL;
const double PI = acos(-1.0);

template <class T> inline  T MAX(T a, T b){if (a > b) return a;return b;}
template <class T> inline  T MIN(T a, T b){if (a < b) return a;return b;}

const int N = 111;
const int M = 11111;
const LL MOD = 1000000007LL;
const int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const int INF = 0x3f3f3f3f;


int mp[555][555];
int d1[555], d2[555];
int pos[555], f;


int main()
{
	int n;
	while (scanf("%d%d", &f, &n) != EOF)
	{
		int i, j, k, u, v, w;
		for (i = 1; i <= n; ++i)
		{
			fill(mp[i] + 1, mp[i] + 1 + n, INF);
			mp[i][i] = 0;
		}
		for (i = 0; i < f; ++i)
			scanf("%d", &pos[i]);
		char str[111];
		getchar();
		while (gets(str) && strlen(str))
		{
			sscanf(str, "%d%d%d", &u, &v, &w);
			mp[u][v] = mp[v][u] = w;
		}
		for (k = 1; k <= n; ++k)
			for (i = 1; i <= n; ++i)
				for (j = 1; j <= n; ++j)
				{
					if (mp[i][j] > mp[i][k] + mp[k][j])
					{
						mp[i][j] = mp[i][k] + mp[k][j];
					}
				}
		fill(d1, d1 + n + 1, INF);
		for (i = 0; i < f; ++i)
		{
			for (j = 1; j <= n; ++j)
				d1[j] = MIN(d1[j], mp[pos[i]][j]);
		}
		int ans = INF, p = -1, mm;
		for (i = 1; i <= n; ++i)
		{
			mm = 0;
			for (j = 1; j <= n; ++j)
				mm = MAX(mm, MIN(d1[j], mp[i][j]));
			if (mm < ans)
			{
				p = i;
				ans = mm;
			}
		}
		printf("%d\n", p);
	}
	return 0;
}