地铁站问题

#include<iostream>
#include<string>
using namespace std;


int find(string train[],string m)
{
    for(int i=0;i<37;i++)
     if(train[i]==m)
     return i;
}
void floy(int a[][37])
{
for(int k=0;k<37;k++)
       for(int i=0;i<37;i++)
  for(int j=0;j<37;j++)
  if(a[i][k]+a[k][j]<a[i][j])
  a[i][j]=a[i][k]+a[k][j];
}
int main()
{
int a[37][37];
string temp1,temp2;
    string train[] = {"A1","A2","A3","A4","A5","A6","A7","A8","A9","T1","A10","A11","A12","A13","T2","A14","A15","A16","A17","A18","B1","B2","B3","B4","B5","T1","B6","B7","B8","B9","B10","T2","B11","B12","B13","B14","B15"};
    for(int i=0;i<37;i++)
for(int j=0;j<37;j++)
           if(i==j)
  a[i][j]=0;
  else if(i==j+1||j==i+1)
  a[i][j]=1;
      else a[i][j]=100;
a[find(train,"A1")][find(train,"A18")]=1;
a[find(train,"A18")][find(train,"A1")]=1;
a[9][25]=0;
a[25][9]=0;
a[14][31]=0;
a[31][14]=0;
a[find(train,"A18")][find(train,"B1")]=100;
a[find(train,"B1")][find(train,"A18")]=100;
cin>>temp1>>temp2;
    floy(a);
cout<<a[find(train,temp1)][find(train,temp2)]+1<<endl;
return 0;
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值