hdu5173 How Many Maos Does the Guanxi Worth

#include<bits/stdc++.h>
using namespace std;
#define INF 0x3f3f3f3f
int dis[];
int visit[];
int SSSP[][];
void dijkstra(int x,int n)
{
   int pos;
   int minn;
   for(int i=;i<=n;i++)
   {
      dis[i]=SSSP[][i];
   }
   visit[x]=;
   dis[x]=;
   for(int i=;i<=n;i++)
   {
        minn=INF;
        pos=;
        for(int j=;j<=n;j++)
        {
           if(!visit[j]&&dis[j]<minn)
           {
              pos=j;
              minn=dis[j];
           }

        }
        if(pos==) break;
        else
        {
            visit[pos]=;
            for(int j=;j<=n;j++)
            {
               if(!visit[j]&& dis[pos]+SSSP[pos][j]<dis[j])
                 dis[j]=dis[pos]+SSSP[pos][j];
            }
        }

   }
}
int main()
{
   while()
   {
      int n,m;   cin>>n>>m;
      if(n==&&m==) break;  int zzzzz=;

      memset(visit,,sizeof(visit));
      memset(dis,,sizeof(dis));
      memset(SSSP,,sizeof(SSSP));

      for(int i=;i<=n;i++)
      {
         for(int j=;j<=n;j++)
           SSSP[i][j]=INF;
      }
      int a[];
      int b[];
      int t[];
      for(int i=;i<=m;i++)
      {
          cin>>a[i]>>b[i]>>t[i];
          SSSP[a[i]][b[i]]=t[i];
          SSSP[b[i]][a[i]]=t[i];
      }
      dijkstra(,n);   //cout<<"*****"<<dis[n]<<"*******"<<zzzzz<<"******"<<endl;
      if(dis[n]==INF)
      {
        zzzzz=;
      }
      int maxn=dis[n];

      for(int i=;i<n;i++)
      {
         //  qu dian chong ding yi
         if(zzzzz==) break;
         for(int j=;j<=n;j++)
         {
             for(int j1=;j1<=n;j1++)
                SSSP[j][j1]=INF;
         }
         for(int j=;j<=m;j++)
         {
              SSSP[a[j]][b[j]]=t[j];
             SSSP[b[j]][a[j]]=t[j];
             if(a[j]==i||b[j]==i)
             {
               SSSP[a[j]][b[j]]=INF;
               SSSP[b[j]][a[j]]=INF;
             }
         }
         //  chong ding yi   visit[]   dis

         memset(visit,,sizeof(visit));
         memset(dis,,sizeof(dis));

         dijkstra(,n);  // cout<<"*****"<<dis[n]<<"*******"<<zzzzz<<"******"<<endl;
         if(dis[n]==INF)
         {
            zzzzz=;
         }
         if(dis[n]>maxn) maxn=dis[n];
      }
      if(zzzzz==)
      cout<<maxn<<endl;
      if(zzzzz==)
      cout<<"Inf"<<endl;
   }
}