NUC_HomeWork1 -- POJ2067(最短路)

C - Fire Station

Description

A city is served by a number of fire stations. Some residents have complained that the distance from their houses to the nearest station is too far, so a new station is to be built. You are to choose the location of the fire station so as to reduce the distance to the nearest station from the houses of the disgruntled residents. 
The city has up to 500 intersections, connected by road segments of various lengths. No more than 20 road segments intersect at a given intersection. The location of houses and firestations alike are considered to be at intersections (the travel distance from the intersection to the actual building can be discounted). Furthermore, we assume that there is at least one house associated with every intersection. There may be more than one firestation per intersection. 

Input

The first line of input contains two positive integers: f,the number of existing fire stations (f <= 100) and i, the number of intersections (i <= 500). The intersections are numbered from 1 to i consecutively. f lines follow; each contains the intersection number at which an existing fire station is found. A number of lines follow, each containing three positive integers: the number of an intersection, the number of a different intersection, and the length of the road segment connecting the intersections. All road segments are two-way (at least as far as fire engines are concerned), and there will exist a route between any pair of intersections.

Output

You are to output a single integer: the lowest intersection number at which a new fire station should be built so as to minimize the maximum distance from any intersection to the nearest fire station.

Sample Input

1 6
2
1 2 10
2 3 10
3 4 10
4 5 10
5 6 10
6 1 10

Sample Output

5
这是仿照人家写的SPFA，然后补上其他3个最短路算法

 /好长时间没写过最短路了，好多基础的东西都不记得了  c
 #include <cstdio>
 #include <iostream>
 #include <cstring>
 #include <cmath>
 #include <algorithm>
 #include <queue>

 using namespace std;

 const int N = , INF = ;

 int head[N], nc, n; ///
 int dis[N];         ///计算距离的数组
 int stk[N], f, r;   ///用数组模拟栈，
 bool vis[N];        ///在用spfa时的标记数组

 struct Edge{        ///边
     int to, next, cost;
 }edge[];

 void add(int a, int b, int c)  ///加边函数，双向
 {
     edge[nc].to = b;
     edge[nc].next = head[a];
     edge[nc].cost = c;
     head[a] = nc++;

     edge[nc].to = a;
     edge[nc].next = head[b];
     edge[nc].cost = c;
     head[b] = nc++;
 }

 void fire_spfa(int fire[], int num)
 {
     memset(vis, false, sizeof(vis));

     f = r = ;                      ///初始化栈

     for(int i = ; i < num; i++)    ///初始化每个消防站到其他点的距离
     {
         int t = fire[i];
         if(!vis[t])
         {
             vis[t] = true;
             dis[stk[r++] = t] = ;///初始化，并将当前点入栈
         }
     }

     while(f != r)               ///如果栈不为空
     {
         int now = stk[f++];     ///从栈中取出栈顶元素
         if(f == N) f = ;       ///防止栈空间不够

         vis[now] = false;       ///将当前结点标记
         for(int i = head[now]; i != -; i = edge[i].next)   ///从边表中取出元素
         {
             int to = edge[i].to;
             int cot = edge[i].cost;

             if(dis[to] > dis[now] + cot)                    ///进行松弛操作
             {
                 dis[to] = dis[now] + cot;
                 if(!vis[to])                                ///如果前驱没有访问过，
                 {
                     stk[r++] = to;                          ///入栈
                     if(r == N)
                         r = ;
                     vis[to] = true;                         ///标记
                 }
             }
         }
     }
 }

 int spfa(int src)
 {
     memset(vis, false, sizeof(vis));
     f = ;
     r = ;

     vis[src] = true;
     int d[N];
     for(int i = ; i <= n; ++i)     ///从当前结点到其余所有结点距离初始化
     {
         d[i] = INF;
     }

     d[src] = ;
     stk[] = src;

     while(f != r)
     {
         int now = stk[f++];
         if(f == N)
             f = ;
         vis[now] = false;

         for(int i = head[now]; i != -; i = edge[i].next)
         {
             int to = edge[i]. to;
             int cot = edge[i].cost;

             if(d[to] > d[now] + cot)
             {
                 d[to] = d[now] + cot;
                 if(!vis[to])
                 {
                     stk[r++] = to;
                     vis[to] = true;
                     if(r == N)
                         r = ;
                 }
             }
         }
     }

     int ans = ;
     for(int i = ; i <= n; ++i)
     {
         ans = max(ans, min(d[i], dis[i]));
     }
     return ans;
 }

 int main()
 {
     int ff, fire[N], a, b, c;

     memset(head, -, sizeof(head));
     nc = ;
     scanf("%d%d", &ff, &n);
     for(int i = ; i < ff; ++i)
     {
         scanf("%d", fire+i);
     }

     while(scanf("%d%d%d", &a, &b, &c) != EOF)
     {
         add(a, b, c);
     }

     for(int i = ; i <= n; ++i)
         dis[i] = INF;

     fire_spfa(fire, ff);

     int id = , ans = INF;

     for(int i = ; i <= n; ++i)
     {
         if(dis[i] != )
         {
             int tp = spfa(i);
             if(ans > tp)
             {
                 ans = tp;
                 id = i;
             }
         }
     }

     printf("%d\n", id);
     return ;
 }