[超源点：还是最短路的变形]hdu2066

这个答案中队列用的for循环的形式还是挺好玩的

#include<bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
int T,S,D,L;
const int MAXN = 1005;
int graph[MAXN][MAXN];
int s[MAXN];
int d[MAXN];
int Dijkstra(int beg,int end){
    bool hash[MAXN];
    int path[MAXN];
    for(int i=0;i<=L;i++){
        hash[i]=true;
        path[i]=INF;
    }
    hash[beg]=false;
    path[beg]=0;
    while(beg!=end){
        for(int i=0;i<=L;i++){
            if(graph[beg][i]!=0){
                if(path[i]>path[beg]+graph[beg][i])
                path[i]=path[beg]+graph[beg][i];
            }
        }
        int min=INF;
        for(int i=0;i<=L;i++){
            if(min>path[i]&&hash[i]){
                min=path[i];
                beg=i;
            }
        }
        hash[beg]=false;
    }
    return path[end];
}
int main()
{
    while(scanf("%d%d%d",&T,&S,&D)!=EOF){
        memset(graph,0,sizeof(graph));
        L=0;
        for(int i=1;i<=T;++i){
            int r,c,cost;
            scanf("%d%d%d",&r,&c,&cost);
            if(graph[r][c]==0) graph[r][c]=graph[c][r]=cost;
            else {
                if(cost < graph[r][c]) graph[r][c]=graph[c][r] =cost;
            }
            if(L < max(r,c)) L=max(r,c);
        }
        for(int i=0;i!=S;i++){
            scanf("%d",&s[i]);
            graph[0][s[i]]=1;
            graph[s[i]][0]=1;
        }
        L++;
        for(int i=0;i!=D;++i){
            scanf("%d",&d[i]);
            graph[d[i]][L]=1;
            graph[L][d[i]]=1;
        }
        cout<<Dijkstra(0,L)-2<<endl;
    }
    return 0;
}