poj 3615 Cow Hurdles

#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <limits.h>
#include <string.h>
#include <algorithm>
#define MAX 330
using namespace std;
int map[MAX][MAX];
int main()
{
	int n,m,p;
	int from,to,len,i,j,k;
	while( ~scanf("%d%d%d",&n,&m,&p) )
	{
		memset(map,0,sizeof(map));
		while( m-- )
		{
			scanf("%d%d%d",&from,&to,&len);
			if( !map[from][to] )
				map[from][to] = len;
			else
				if( len < map[from][to] )
					map[from][to] = len;
		}
		for(i=1; i<=n; i++)
			for(k=1; k<=n; k++)
				for(j=1; j<=n; j++)
					if( map[k][i] && map[i][j] )
						if( !map[k][j] )
							map[k][j] = max(map[k][i],map[i][j]);
						else
							map[k][j] = min(map[k][j],max(map[k][i],map[i][j]));
		while( p-- )
		{
			scanf("%d%d",&from,&to);
			if( map[from][to] )
				printf("%d/n",map[from][to]);
			else
				printf("-1/n");
		}
	}
return 0;
}