[bzoj1774] [Usaco2009 Dec]Toll 过路费

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6 const int maxn=253;
 7 struct point{
 8     int pos,val;
 9 }poi[maxn];
10 int ans[10023],dis[maxn][maxn],map[maxn][maxn];
11 int i,j,k,n,m,K,tot,a,b,d,num;
12 int ra;char rx;
13 inline int read(){
14     rx=getchar();ra=0;
15     while(rx<‘0‘||rx>‘9‘)rx=getchar();
16     while(rx>=‘0‘&&rx<=‘9‘)ra*=10,ra+=rx-48,rx=getchar();return ra;
17 }
18 bool cmp(point a,point b){return a.val<b.val;}
19 int main(){
20     n=read();m=read();K=read();
21     for(i=1;i<=n;i++)poi[i].val=read(),poi[i].pos=i;
22     sort(poi+1,poi+1+n,cmp);
23     for(i=1;i<=n;i++)memset(dis[i],50,(n+1)<<2),memset(map[i],50,(n+1)<<2),dis[i][i]=0;
24     for(i=1;i<=m;i++)a=read(),b=read(),d=read(),dis[b][a]=dis[a][b]=min(dis[a][b],d);
25     for(k=1,d=poi[k].pos;k<=n;k++,d=poi[k].pos)
26     for(i=1,a=poi[i].pos;i<=n;i++,a=poi[i].pos)for(j=1,b=poi[j].pos;j<=n;j++,b=poi[j].pos){
27             if(dis[a][d]+dis[d][b]<dis[a][b])dis[a][b]=dis[a][d]+dis[d][b];
28             map[a][b]=min(map[a][b],dis[a][b]+poi[max(i,max(j,k))].val);
29         }
30     for(i=1;i<=K;i++)a=read(),b=read(),printf("%d\n",map[a][b]);
31     return 0;
32 }