• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            misschuer

            常用鏈接

            統計

            積分與排名

            百事通

            最新評論

            一個人的旅行GY

            #include<iostream>

            using namespace std ;

            #define N 1001

            #define MAX 10000

            int dist [ N ] ;

            bool flag [ N ] ;

            int v [ N ] [ N ] ;

            int number ;

            int mindist ()
            {

                  int index = -1 ;
                 
                  int i , j ;
                 
                  for ( i = 1 ; i <= number ; ++ i )
                 
              if ( flag [ i ] )
              {
              
                      index = i ;
                     
                      break ;
                     
              }
              
               for ( j = i + 1 ; j <= number ; ++ j )
              
              if( dist [ index ] > dist [ j ] && flag [ j ] )
              
               index = j ;

                  return index ;
                 
            }

            int main ()
            {
                int t , s , d ;
               
                int a , b , time ;
               
                int i , j , k ;
               
                int city ;
               
                int min ;
               
                int want ;

             for ( i = 1 ; i <= 1000 ; ++i )
             
              for ( j = 1 ; j <= 1000 ; ++ j )
              {
              
               v [ i ] [ j ] = v [ j ] [ i ] = MAX ;
               
              }
              
              dist [ 0 ] = 0 ;

                while ( scanf( "%d%d%d" , & t , & s , & d ) != EOF )
                {

                        number = 0 ;
                       
                        for ( i = 1 ; i <= t ; ++ i )
                        {

                            scanf ( "%d%d%d" , & a , & b , & time ) ;
                           
                if ( v [ a ] [ b ] > time )
                
                              v [ b ] [ a ] = v [ a ] [ b ] = time ;
                             
                            if ( number < b )
                           
                            number = b ;
                           
                            if( number < a )
                           
                             number = a ;
                           
                            }

                        for ( i = 1 ; i <= number ; ++ i )
                       
                            flag [ i ] = true ;

                        for ( i = 1 ; i <= s ; ++ i )
                        {

                            scanf ( "%d" , & city ) ;

                            v [ city ] [ 1 ] = 0 ;
                           
                        }

                       

                        j = 1 ;
               k = 0 ;
                        while ( j )
                        {

                            if ( k != -1 )
                            {

                                for ( i = 1 ;i <= number ; ++ i )
                                {

                  if ( k == 0 )
                  
                   dist [ i ] = v [ i ] [ 1 ] ;
                   
                  else
                  {
                  
                                       if( dist [ i ] > v [ i ] [ k ] + dist [ k ] )
                                      
                                           dist [ i ] = v [ i ] [ k ] + dist [ k ] ;
                  }
                  
                                }
                               
                                flag [ k ] = false ;
                               
                            }
                           
                            else
                           
                                break ;

                 k = mindist () ;
                
                        }
             
                       scanf ( "%d" , & want ) ;
                      
                        min = dist [ want ] ;
                       
                        for ( i = 2 ; i <= d ; ++ i )
                        {

                            scanf ( "%d" , & want ) ;
                           
                            if ( min > dist [ want ] )
                           
                                min = dist [ want ] ;
                               
                        }
                       
                        printf ( "%d\n" , min ) ;

                        for ( i = 1 ; i <= number ; ++ i )
                       
                            for ( j = i ; j <= number ; ++ j )
                           
                                v [ i ] [ j ] = v [ j ] [ i ] = MAX ;
                               
                }
               
                return 23 ;
               
            }

            用 dijstla 算法

            posted on 2009-04-18 10:21 此最相思 閱讀(96) 評論(0)  編輯 收藏 引用

            午夜精品久久久久久影视777| 色妞色综合久久夜夜| 国产美女久久精品香蕉69| 性欧美大战久久久久久久久| 久久久精品国产sm调教网站| 久久人人爽爽爽人久久久| 久久亚洲国产成人影院网站| 欧美国产成人久久精品| 免费国产99久久久香蕉| 精品永久久福利一区二区| 久久久99精品一区二区| 亚洲中文字幕无码久久综合网| 婷婷久久五月天| 国产一区二区精品久久凹凸| 精品久久久久久无码不卡| 狠狠人妻久久久久久综合蜜桃| 2021国产精品久久精品| 久久综合精品国产一区二区三区 | 伊人丁香狠狠色综合久久| 久久久亚洲裙底偷窥综合| 一本久久综合亚洲鲁鲁五月天亚洲欧美一区二区 | 久久久久99精品成人片牛牛影视 | 久久综合丁香激情久久| 无码精品久久久久久人妻中字| 2021国产精品久久精品| 国产综合免费精品久久久| 久久久中文字幕| 久久久久一级精品亚洲国产成人综合AV区| 国产亚洲色婷婷久久99精品| 久久午夜伦鲁片免费无码| 亚洲愉拍99热成人精品热久久 | 免费观看久久精彩视频| 97超级碰碰碰久久久久| 久久精品国产99国产电影网| 久久久久成人精品无码中文字幕 | 日本精品久久久中文字幕| 久久久久夜夜夜精品国产| 老司机午夜网站国内精品久久久久久久久| 国产69精品久久久久9999| 亚洲欧美日韩中文久久 | 久久久一本精品99久久精品88|