zoukankan      html  css  js  c++  java
  • poj2387 Til the Cows Come Home 最短路径dijkstra算法

    Description

    Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible. 

    Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it. 

    Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.

    Input

    * Line 1: Two integers: T and N 

    * Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.

    Output

    * Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.

    Sample Input

    5 5
    1 2 20
    2 3 30
    3 4 20
    4 5 20
    1 5 100

    Sample Output

    90

    dijkstra算法模板题;
    AC代码:
    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <vector>
    #include <queue>
    #include <algorithm>
    #define inf 0xfffffff
    using namespace std;
    int p[1003][1003],flag[1003],dis[1003],mmin,n,t;
    int dijkstra()
    {
        memset(flag,0,sizeof(flag));
        for(int i=2;i<=n;i++)
        {
            dis[i]=p[1][i];
        }
        flag[1]=1;
        int pre;
        for(int i=1;i<=n;i++)
        {
            mmin=inf;
            for(int j=1;j<=n;j++)
            {
                if(flag[j]==0&&dis[j]<mmin)
                {
                    mmin=dis[j];
                    pre=j;
                }
            }
            if(mmin==inf)break;
            flag[pre]=1;
            for(int j=1;j<=n;j++)
            {
                if(flag[j]==0&&dis[pre]+p[pre][j]<dis[j])
                {
                    dis[j]=dis[pre]+p[pre][j];
                }
            }
        }
    }
    int main()
    {
        int a,b,l;
        while(scanf("%d%d",&t,&n)!=EOF)
        {
            for(int i=1;i<=n;i++)
            {
                for(int j=1;j<=n;j++)
                {
                    p[i][j]=inf;
                }
            }
            for(int i=0;i<t;i++)
            {
                scanf("%d%d%d",&a,&b,&l);
                if(l<p[a][b])
                {
                    p[a][b]=p[b][a]=l;
                }
            }
            dijkstra();
            printf("%d
    ",dis[n]);
        }
        return 0;
    }
     
  • 相关阅读:
    hdu1716排列2(stl:next_permutation+优先队列)
    iOS UIWebView 载入https 网站出现NSURLConnection/CFURLConnection HTTP load failed (kCFStreamErrorDomainSSL,
    C++学习笔记23,类内函数重载
    Java---16---多线程---死锁
    Ubuntu上的Hadoop安装教程
    SAP BAPI一览 史上最全
    python脚本从excel表到处数据,生成指定格式的文件
    hdu 4865 Peter&#39;s Hobby
    【VUE】100. vue踩坑集锦
    【VUE】2.搭建vue脚手架@vue/cli,新建第一个vue项目
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5154999.html
Copyright © 2011-2022 走看看