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;
    }
     
  • 相关阅读:
    【Matlab】把一年中的某一天(从1月1日起)换算成日期
    【工具】用hexo搭建博客
    【工具】文献分析工具histcite的简单使用
    【工具】用PPT排版打印海报时图片分辨率问题
    【工具】PPT插入高清图片保存后图片变模糊的解决方法
    【工具】排版软件TeX Live 2016的简单使用
    【工具】文字识别软件(OCR) ABBYY Finereader 11简单使用
    【Matlab】编程风格摘录
    【信号】用matlab实现一维信号的高斯滤波
    【GMT5】用GMT绘制测高卫星Topex_Poseidon_Jason的地面轨迹
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5154999.html
Copyright © 2011-2022 走看看