pku1502.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#define size 110
#define TheMax 10000000
int D[size][size];
int N;

void Solve()
{
	int i, j, k, max;
	char s[20];
	for (i = 0; i < N; i++)
	{
		D[i][i] = 0;
	}
	for (i = 1; i < N; i++)
	{
		for (j = 0; j < i; j++)
		{
			scanf("%s", s);
			if (s[0] == 'x')
			{
				D[i][j] = D[j][i] = TheMax;
			}
			else
			{
				D[i][j] = D[j][i] = atoi(s);
			}
		}
	}
	for (k = 0; k < N; k++)
	{
		for (i = 0; i < N; i++)
		{
			for (j = 0; j < N; j++)
			{
				if (D[i][j] > D[i][k] + D[k][j])
				{
					D[i][j] = D[i][k] + D[k][j];
				}
			}
		}
	}
	for (i = 0, max = 0; i < N; i++)
	{
		if (D[i][0] > max)
		{
			max = D[i][0];
		}
	}
	printf("%d\n", max);
}

int main()
{
	while (scanf("%d", &N) != -1)
	{
		Solve();
	}
	return 0;
}