hdu 2066 一个人的旅行

我觉得这题应该用floyd算法会更好一点吧，（猜的，还没学，囧......）

我是用dijstra暴力水过..........，嗯开始学floyd

code

#include <set>
#include <map>
#include <ctime>
#include <queue>
#include <cmath>
#include <stack>
#include <limits>
#include <vector>
#include <bitset>
#include <string>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <string.h>
#include <iostream>
#include <algorithm>
#define Si set<int>
#define LL long long
#define pb push_back
#define PS printf(" ")
#define Vi vector<int>
#define LN printf("\n")
#define lson l,m,rt << 1
#define rson m+1,r,rt<<1|1
#define SD(a) scanf("%d",&a)
#define PD(a) printf("%d",a)
#define SET(a,b) memset(a,b,sizeof(a))
#define FF(i,a) for(int i(0);i<(a);i++)
#define FD(i,a) for(int i(a);i>=(1);i--)
#define FOR(i,a,b) for(int i(a);i<=(b);i++)
#define FOD(i,a,b) for(int i(a);i>=(b);i--)
#define readf freopen("input.txt","r",stdin)
#define writef freopen("output.txt","w",stdout)
const int maxn = 1005;
const int INF = 0xfffffff;
const int dx[]={0,1,0,-1};
const int dy[]={1,0,-1,0};
const double pi = acos(-1.0);
using namespace std;
int T,S,D,cnt;//cnt代表有多少个城市
int dis[maxn],edge[maxn][maxn],link[maxn],dream[maxn];
bool vis[maxn];
int dijstra(int v){
    SET(vis,false);
    FOR(i,1,cnt) dis[i]=edge[v][i];
    vis[v]=true;
    dis[v]=0;
    int tmp,k;
    FOR(i,1,cnt){
        tmp=INF;
        FOR(j,1,cnt){
            if(!vis[j] && dis[j]<tmp){
                tmp=dis[j];
                k=j;
            }
        }
        vis[k]=true;
        FOR(j,1,cnt){
            if(!vis[j] && dis[j] > dis[k]+edge[k][j])
                dis[j]=dis[k]+edge[k][j];
        }
    }
    int minn=INF;
    FOR(i,1,D){
        minn=min(dis[dream[i]],minn);
    }
    return minn;
}
int main()
{
    int N,M,a,b,x;
    while(~scanf("%d%d%d",&T,&S,&D)){
        FF(i,maxn) FF(j,maxn) edge[i][j]=INF;
        FF(i,maxn) dis[i]=INF;
        cnt=0;
        FOR(i,1,T){
            scanf("%d%d%d",&a,&b,&x);
            edge[a][b]=edge[b][a]=min(edge[a][b],x);
            cnt=max(max(b,a),cnt);
        }
        FOR(i,1,S) scanf("%d",&link[i]);
        FOR(i,1,D) scanf("%d",&dream[i]);
        //dijstra
        int minn=INF;
        FOR(i,1,S){
            minn=min(minn,dijstra(link[i]));
        }
        printf("%d\n",minn);
    }
	return 0;
}