hdu 1595 find the longest of the shortest(最短路spfa)

一个人要从1走到N点，中间可能某一条路会断掉，求最短路最坏的情况, 也就是断掉某条路时，最短路径最长。

枚举删边求最短路

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <queue>
#define MAXN 2005
#define MAXM 2005*2005
#define INF 0x1f1f1f1f
using namespace std;
int n, m;
struct EDGE
{
    int v, next;
    int w;
}edge[MAXM*2];
int head[MAXN], e;
int vis[MAXN];
int d[MAXN];
int pre[MAXN];//记录最短路径
void init()
{
    e = 0;
    memset(head, -1, sizeof(head));
}
void add(int u, int v, int w)
{
    edge[e].v = v;
    edge[e].w = w;
    edge[e].next = head[u];
    head[u] = e++;
}
void bfs(int src)
{
    for(int i = 1; i <= n; i++) {vis[i] = 0, d[i] = INF;}
    queue<int>q;
    while(!q.empty())q.pop();
    q.push(src);
    vis[src] = 1;
    d[src] = 0;
    while( !q.empty() )
    {
        int u = q.front();
        q.pop();
        vis[ u ]=0;
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].v;
            int w = edge[i].w;
            if(d[u] + w < d[v])
            {
                pre[v]=u;
                d[v] = d[u] + w;
                if(!vis[v])
                {
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }
}
struct ROAD
{
    int x,y;
}road[2005*2005];
void changeit(int x,int y,int w)
{
    for(int i=head[x];i!=-1;i=edge[i].next )
        if(edge[i].v==y)edge[i].w=w;

}
int g[2005][2005];
int main()
{
    int u, v, w, cnt,i;
    int res;
    while(scanf("%d%d", &n,&m)!=EOF)
    {
        init();
        for( i = 1; i <= m; i++)
        {
            scanf("%d%d%d", &u, &v, &w);
            add(u, v, w);
            add(v, u, w);
            g[u][v]=w;
            g[v][u]=w;
        }
        bfs(1);
        cnt=0;
        for(i=n;i!=1;i=pre[i])
        {
            road[cnt].x=i;
            road[cnt].y=pre[i];
            cnt++;
        }
        res=0;
        for(i=0;i<cnt;i++)
        {
             changeit(road[i].x, road[i].y, INF);
             changeit(road[i].y, road[i].x, INF);
             bfs(1);
             if(d[n] > res&&d[n]<INF) res = d[n];
             changeit(road[i].x, road[i].y, g[road[i].x][road[i].y]);
             changeit(road[i].y, road[i].x, g[road[i].x][road[i].y]);
        }
        printf("%d\n",res);

    }
    return 0;
}