zoukankan      html  css  js  c++  java
  • find the longest of the shortest

    find the longest of the shortest

    Time Limit:5000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
    Appoint description: 

    Description

    Marica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in the same city, she started preparing for the long journey.We know for every road how many minutes it takes to come from one city to another. 
    Mirko overheard in the car that one of the roads is under repairs, and that it is blocked, but didn't konw exactly which road. It is possible to come from Marica's city to Mirko's no matter which road is closed. 
    Marica will travel only by non-blocked roads, and she will travel by shortest route. Mirko wants to know how long will it take for her to get to his city in the worst case, so that he could make sure that his girlfriend is out of town for long enough.Write a program that helps Mirko in finding out what is the longest time in minutes it could take for Marica to come by shortest route by non-blocked roads to his city.
     

    Input

    Each case there are two numbers in the first row, N and M, separated by a single space, the number of towns,and the number of roads between the towns. 1 ≤ N ≤ 1000, 1 ≤ M ≤ N*(N-1)/2. The cities are markedwith numbers from 1 to N, Mirko is located in city 1, and Marica in city N. 
    In the next M lines are three numbers A, B and V, separated by commas. 1 ≤ A,B ≤ N, 1 ≤ V ≤ 1000.Those numbers mean that there is a two-way road between cities A and B, and that it is crossable in V minutes.
     

    Output

    In the first line of the output file write the maximum time in minutes, it could take Marica to come to Mirko.
     

    Sample Input

    5 6
    1 2 4
    1 3 3
    2 3 1
    2 4 4
    2 5 7
    4 5 1
     
    6 7
    1 2 1
    2 3 4
    3 4 4
    4 6 4
    1 5 5
    2 5 2
    5 6 5
     
    5 7
    1 2 8
    1 4 10
    2 3 9
    2 4 10
    2 5 1
    3 4 7
    3 5 10
     

    Sample Output

    11
    13
    27
     
    最短路问题:
        分别删除最短路上的边即可,O(n3);
    #include<cstdio>
    #include<iostream>
    #include<cstring>
    #include<algorithm>
    const int INF = 0x3f3f3f3f;
    using namespace std;
    int n;
    bool vis[1005];
    bool flag;
    int dis[1005][1005];
    int d[1005];
    int mak[1005];
    void init(){
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= n; j++){
                dis[i][j] = INF;
            }
            dis[i][i] = 0;
            mak[i] = 1;
        }
    }
    int dijkstra(){
        for(int i = 1; i <= n; i++){
            vis[i] = 0;
            d[i] = dis[1][i];
        }
        vis[1] = 1;
        for(int i = 1; i <= n; i++){
            int k = -1;
            int minn = INF;
            for(int j = 1; j <= n; j++){
                if(!vis[j] && minn > d[j]){
                    k = j;
                    minn = d[j];
                }
            }
            if(k == -1)
                break;
            vis[k] = 1;
            for(int j = 1; j <= n; j++){
                if(!vis[j] && d[j] > d[k] + dis[k][j]){
                    d[j] = d[k] + dis[k][j];
                    if(!flag)mak[j] = k;
                }
            }
        }
        return d[n];
    }
    int main(){
        int m;
        while(~scanf("%d%d", &n, &m)){
            init();
            for(int i = 0; i < m; i++){
                int x, y, w;
                scanf("%d%d%d", &x, &y, &w);
                dis[x][y] = dis[y][x] = w;
            }
            flag = 0;
            int ans = dijkstra();
            flag = 1;
            for(int i = n; i != 1; i = mak[i]){//最短路径上的点;
                int j = mak[i];
                int tep = dis[i][j];//最短路径上的边;
                dis[i][j] = dis[j][i] = INF;//分别断开最短路径上的边;
                int temp = dijkstra();
                ans = max(ans, temp);
                dis[i][j] = dis[j][i] = tep;//恢复最短路径上的边;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    一个兼容各浏览器的阻止冒泡的StopPropagation解决方案
    百度面试题:从输入URL到显示网页,后台发生了什么?
    三角形面积公式S=(1/2)absinC的证明
    正弦定理证明(方法二)
    高中数学总结(高一上半部分内容)
    解析几何部分
    正弦定理的证明(方法一)
    平面向量的坐标表示
    将三角函数值转换为角度
    余弦定理方法证明
  • 原文地址:https://www.cnblogs.com/ACMessi/p/4876100.html
Copyright © 2011-2022 走看看