Gold King的搬家方案题解

#include<bits/stdc++.h>
using namespace std;
int n,m,s,t,ans=0;//计数器
int a[1001][1001];//距离数组及必经之路数组
int main(){
    cin>>n>>m;
    memset(a,0x3f,sizeof a);
    for(int i = 1;i <= n;i++)a[i][i]=0;
    for(int i = 1;i <= m;i++){
        int a1,b,c;
        cin>>a1>>b>>c;
        a[a1][b]=a[b][a1]=min(a[a1][b],c);
    }
    for(int k = 1;k <= n;k++)for(int i = 1;i <= n;i++)for(int j = 1;j <= n;j++)a[i][j]=min(a[i][j],a[i][k]+a[k][j]);
    cout<<a[1][n];
    return 0;
}