SDUT 2155 Emergency(Floyd)

关键是怎么优化最短路，当我们标记一个点的时候直接就可以以当前这个点去更新其他在集合中的点。

#include<map>
#include<cmath>
#include<queue>
#include<cmath>
#include<string>
#include<cstdio>
#include<stack>
#include<iostream>
#include<cstring>
#include<algorithm>
#define inf 0x3f3f3f3f
#define eps 1e-8
#define ls l,mid,rt<<1
#define rs mid+1,rt,rt<<1|1
#define LL __int64
#define ll long long
#include<cmath>
bool vis[400];
int n,cnt;
int mp[310][310];

int main(){
    int m,i,j,k,cla = 1 ;
    while(~scanf("%d%d%d",&n,&m,&k)){
        if(!n&&!m&&!k) break;
       for(i  = 0;i < n;++ i)
       {
           for(j = i;j < n;++ j){
            i==j?mp[i][j]=0:mp[i][j]=mp[j][i]=inf;
           }
       }

        for(i = 0 ;i < m;++ i){
            int x,y,c;
            scanf("%d%d%d",&x,&y,&c);
            if(mp[x][y] > c)
                mp[x][y] = c;
        }

        printf("Case %d:\n",cla++);
        memset(vis,false,sizeof(vis));
        while(k--){
            int bj,aa,bb;
            scanf("%d",&bj);
            if(!bj){
                int poi;
                scanf("%d",&poi);
                if(vis[poi]){
                    printf("City %d is already recaptured.\n",poi);
                    continue;
                }
                vis[poi] = true;
                for(i = 0;i < n;++i){
                    for(j =0;j < n;++j){
                        if(mp[i][j]>mp[i][poi]+mp[poi][j])
                        mp[i][j] = mp[i][poi]+mp[poi][j];
                    }
                }
            }
            else{
                scanf("%d%d",&aa,&bb);
                if(!vis[aa]||!vis[bb]){
                    printf("City %d or %d is not available.\n",aa,bb);
                }
                else {
                    if(mp[aa][bb]!=inf ){
                        int dis = mp[aa][bb];
                        printf("%d\n",dis);
                    }
                    else
                        puts("No such path.");
                }
            }
        }
        puts("");
    }
    return 0;
}