HDU 1596——find the safest road
2013-04-28 17:48
375 查看
最小生成树
dij算法就可解决。
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define maxn 1005
double map[maxn][maxn],dis[maxn];
bool que[maxn];
int main()
{
int n,i,j;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%lf",&map[i][j]);
int t,s,e,k;
double temp;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&s,&e);
memset(que,0,sizeof(que));
for(i=1;i<=n;i++)
dis[i]=map[s][i];
que[s]=1;
dis[s]=1;
for(i=1;i<=n;i++)
{
temp=0.0;
for(j=1;j<=n;j++)
if(!que[j]&&temp<dis[j])
{
temp=dis[j];
k=j;
}
if(temp==0)
break;
if(que[e])
break;
que[k]=1;
for(j=1;j<=n;j++)
if(!que[j]&&dis[j]<dis[k]*map[k][j])
dis[j]=dis[k]*map[k][j];
}
if(dis[e]==0.0)
printf("What a pity!\n");
else
printf("%.3lf\n",dis[e]);
}
}
return 0;
}
dij算法就可解决。
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
#define maxn 1005
double map[maxn][maxn],dis[maxn];
bool que[maxn];
int main()
{
int n,i,j;
while(scanf("%d",&n)!=EOF)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
scanf("%lf",&map[i][j]);
int t,s,e,k;
double temp;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&s,&e);
memset(que,0,sizeof(que));
for(i=1;i<=n;i++)
dis[i]=map[s][i];
que[s]=1;
dis[s]=1;
for(i=1;i<=n;i++)
{
temp=0.0;
for(j=1;j<=n;j++)
if(!que[j]&&temp<dis[j])
{
temp=dis[j];
k=j;
}
if(temp==0)
break;
if(que[e])
break;
que[k]=1;
for(j=1;j<=n;j++)
if(!que[j]&&dis[j]<dis[k]*map[k][j])
dis[j]=dis[k]*map[k][j];
}
if(dis[e]==0.0)
printf("What a pity!\n");
else
printf("%.3lf\n",dis[e]);
}
}
return 0;
}
相关文章推荐
- hdu1596 find the safest road
- hdu1596 find the safest road
- HDU 1596----find the safest road
- HDU 1596 find the safest road
- hdu 1596 find the safest road
- hdu-1596-find the safest road(dijkstra)
- HDU 1596 find the safest road
- 两道最短路裸题(HDU 2544 最短路 / HDU 1596 find the safest road)
- HDU 1596 find the safest road (最短路径----dijkstra)
- Hdu 1596 find the safest road
- hdu 题目1596 find the safest road (最短路径 dijkstra)
- HDU1596 find the safest road---(最短路径dijkstra,#变形#)
- HDU 1596 find the safest road
- hdu 1596 find the safest road
- hdu 1596 find the safest road (变形SP && dij+heap)
- HDU 1596 find the safest road (spfa算法)
- HDU 1596 find the safest road
- HDU 1596 find the safest road
- HDU 1596 find the safest road (最短路)
- HDU-1596-find the safest road(最短路)