find the longest of the shortest

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

题意：前女朋友要来到胖胖mirko的城市，前女友从她的城市到mirko的城市走最短的路，可是有一条路可能会被堵，问mirko至少让现女友出去几分钟才能保证不会让她们碰见；其实就是求现女友到mirko的城市最坏的情况下；

枚举没有堵塞的情路下走的每一条路，求出最长的就好了

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
using namespace std;
const int MAXN=1000+10;
const int inf=0x3f3f3f;
int n,m;
int map[MAXN][MAXN],dis[MAXN];
int book[MAXN],flag[MAXN];
void dij(int p)
{
    memset(book,0,sizeof(book));
    for(int i=1; i<=n; i++) dis[i]=inf;
    dis[1]=0;
    for(int i=1; i<=n; i++)
    {
        int minn=inf,u;
        for(int j=1; j<=n; j++)
        {
            if(!book[j]&&dis[j]<minn)
            {
                minn=dis[j];
                u=j;
            }
        }
        book[u]=1;
        for(int v=1; v<=n; v++)
        {
            if(dis[v]>dis[u]+map[u][v])
            {
                dis[v]=dis[u]+map[u][v];
                if(p) flag[v]=u;
            }
        }
    }
}
int main()
{
    while(~scanf("%d%d",&n,&m))
    {
        for(int i=1; i<=n; i++)
            for(int j=1; j<=n; j++)
                if(i==j) map[i][j]=0;
                else map[i][j]=inf;
        int a,b,c;
        for(int i=1; i<=m; i++)
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a][b]=map[b][a]=c;
        }
        memset(flag,0,sizeof(flag));
        dij(1);
        int maxn=0;
        for(int i=n; i!=1; i=flag[i])
        {
            int t=map[flag[i]][i];
            map[flag[i]][i]=map[i][flag[i]]=inf;
            dij(0);
            maxn=max(maxn,dis[n]);
            map[flag[i]][i]=map[i][flag[i]]=t;
        }
        printf("%d\n",maxn);
    }
    return 0;
}