题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2066
题意:给你一个无向图,然后给你一个开始集合,再给你一个结束集合,问开始集合中任意点到结束集合中任一点的最短距离是。
思路:草儿的家为0,草儿的家到开始集合里任意元素的距离都为0,然后一次dijkstra就可以了
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<set>
#include<stack>
#include<ctime>
#include<queue>
#define LOCAL
#define mst(a,b) memset(a,b,sizeof(a))
const int INF = 0x3f3f3f3f;
const int maxn = 30000;
using namespace std;
int map[1020][1020],d[1020],flag[1020],a[1020],b[1020];
void Dijkstra(int n){
int v , k;
mst(flag,0);
mst(d,INF);
for(int i = 1 ; i <= n; i++)
d[i] = map[0][i];
flag[0] = 1; d[0] = 0;
for(int i = 1 ; i <= n ;i++){
int min = INF;
for(int j = 1; j <= n ; j++)
if(!flag[j]&(min > d[j])){
min = d[j];
k = j;
}
flag[k] = 1;
for(int j = 1; j <=n ; j++)
if(!flag[j]&(d[j] > min + map[k][j]))
d[j] = min + map[k][j];
}
}
int main(){
/*#ifdef local
freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
#endif*/
int x , y , f,n,m,t;
while(~scanf("%d%d%d",&n,&m,&t)){
mst(map,INF);
int max = -1;
for(int i = 0; i < n ; i++){
scanf("%d%d%d",&x,&y,&f);
if(x > max) max = x; if(y > max) max = y;
if(f < map[x][y]) map[x][y] = map[y][x] = f;
}
for(int i = 0; i < m; i++){
scanf("%d",&a[i]);
map[0][a[i]] = map[a[i]][0] = 0;
}
Dijkstra(max);
int min = INF;
for(int j = 0; j < t; j++){
scanf("%d",&b[j]);
if(d[b[j]] < min) min = d[b[j]];
}
printf("%d\n",min);
}
return 0;
}