UVa 544 Heavy Cargo Solution

#include<iostream>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<utility>
#include<iomanip>
#include<queue>
using namespace std;
#define clr(a) memset(a,0,sizeof(a))
#define PB push_back
#define pi 3.1415926535897932384626433832795
int city[500][500],ct,street,tc;
map<string,int>mp;

void indexing()
{
       int index=0,i,cost;
       string s1,s2;
       for(i=0;i<street;i++)
       {
           cin>>s1>>s2>>cost;
           if(mp[s1]==0)
           mp[s1]=++index;
           if(mp[s2]==0)
           mp[s2]=++index;
           city[mp[s1]][mp[s2]]=cost;
           city[mp[s2]][mp[s1]]=cost;
       }
}

void Floyd_Warshall()
{
    int i,j,k;
    for(k=1;k<=ct;k++)
        for(i=1;i<=ct;i++)
            for(j=1;j<=ct;j++)
                city[i][j]=max(city[i][j],min(city[i][k],city[k][j]));
}

int main()
{
    string source,destination;
   while(cin>>ct>>street)
   {
      if(ct==0 && street==0)    return 0;
      indexing();
      Floyd_Warshall();
      cin>>source>>destination;
      cout<<"Scenario #"<<++tc<<endl<<city[mp[source]][mp[destination]]<<" tons"<<endl<<endl;
      mp.clear();
      clr(city);
   }
return 0;
}