ACM征途——第一次上传poj 1797作为纪念

1797是 dijk的变形，蛮简单

 

#include<iostream>

using namespace std;
int map[1002][1002];
int dis[1002],use[1002];
int from,to,wei,num,n,m;
int maxwei;
 
void dijk()
{

  int i,k,j,temp;
  dis[1]=0;
  use[1]=1;
  for(i=1;i<=n;i++)
    { 
       dis[i]=0;
       if(map[1][i])         
       dis[i]=map[1][i];                         
    }

  for(i=1;i<=n;i++)
   {  
       int max=0;
      
       for(k=1;k<=n;k++)
        {
            if(dis[k]>max&&!use[k])
             {
               max=dis[k];
               j=k;
             }          
        }
       
       use[j]=1;
        
       for(k=1;k<=n;k++)
         {   if(!use[k])
            {
             if(map[j][k]>dis[j])temp=dis[j];
             else temp=map[j][k];
             if(temp>dis[k])
             dis[k]=temp;
             }  
         }
   }

}

 

 

 

int main()
{ 
   
   
   int k=0;
   while(cin>>num)
    {
        for(k=0;k<num;k++)
         { 
            maxwei=0;
            memset(map,0,sizeof(map));
            memset(use,0,sizeof(use));
            int i,j;
            cin>>n>>m;
         
              for(j=0;j<m;j++)
                 {
                    scanf("%d" "%d" "%d",&from,&to,&wei);         
                   //cin>>from>>to>>wei;
                   map[from][to]=map[to][from]=wei;
                  
                 }
             dijk();
             cout<<"Scenario #"<<k+1<<":"<<endl;

             cout<<dis[n]<<endl; 
              if(k!=num-1)
                cout<<endl;           
         }

   }

return 0;
}