【HDU 2066】一个人的旅行

#include<bits/stdc++.h>
using namespace std;
#define inf 99999999
int n,u,v,w,book[1005],dis[1005],e[1005][1005],minn;
void dj()
{
    int i,j;
    for(i=1;i<=n-1;i++)
    {
        minn=inf;
        for(j=1;j<=n;j++)
        {
            if(!book[j]&&dis[j]<minn)
            {
                minn=dis[j];
                u=j;
            }
        }
        book[u]=1;
        for(v=1;v<=n;v++)
        {
            if(e[u][v]<inf&&dis[v]>dis[u]+e[u][v])
            dis[v]=dis[u]+e[u][v]; 
        }
    }
}
int main()
{
    int i,j,k[1005],a,t,s,d; 
    while(cin>>t>>s>>d)
    {
        n=0; 
        memset(k,0,sizeof k);
        for(i=0;i<=1000;i++)
            for(j=0;j<=1000;j++)
                e[i][j]=inf;
            e[i][i]=0; 
            
        while(t--)
        {
            scanf("%d%d%d",&u,&v,&w);
            n=max(n,max(u,v));
            if(w<e[u][v])
            e[u][v]=e[v][u]=w;
        } 
        while(s--)
        {
            scanf("%d",&v);
            e[0][v]=e[v][0]=0;
        }
        memset(book,0,sizeof book);
        book[0]=1;
        
        for(i=0;i<=n;i++)
            dis[i]=e[0][i];
            
        dj();
        for(i=1;i<=d;i++)
            scanf("%d",&k[i]);
 
        minn=inf;
        for(i=1;i<=d;i++)
        {
            if(minn>dis[k[i]])
            　　minn=dis[k[i]];
        }
        printf("%d\n",minn);
    } 
    return 0;
}