地铁站问题
来源:互联网 发布:深圳淘宝加盟公司 编辑:程序博客网 时间:2024/04/27 05:08
#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;
}
#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
- 地铁站问题
- 蓝桥杯地铁换乘问题
- 华为地铁换乘问题
- 地铁换乘的线路问题
- 地铁
- 地铁站的小提琴家
- 地铁站小偷卖手机
- 地铁站的安检人员
- 华为机试地铁换乘问题
- 地铁换乘-最短路径问题
- 华为机试--地铁换乘问题
- 华为笔试题:地铁换乘问题
- csp ccf 2017 3修地铁问题
- 北京一高二女生在地铁站卧轨
- 南京印象之新街口地铁站
- poj 2502 floyd 家-地铁站-学校
- 穿梭于北京的地铁站
- 基于HTML5 Canvas 实现地铁站监控
- 编程之美之格格取数
- 如何高效使用Google
- 放积木
- 计算机网络(1)
- Mybatis入門實例
- 地铁站问题
- Android中Http请求中问乱码问题解决
- 四则运算之后缀求值
- Linux设备驱动之Framebuffer分析
- 【Java Web】大话Session
- 设计模式-工厂方法
- 【测试】测试异常以及异常信息
- 八皇后问题c++ 代码
- Android中Bitmap分割图片