poj 2387 Til the Cows Come Home(Dijkstra)
2016-03-17 22:21
323 查看
问题描述
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various
lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
输入
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
输出
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
样例输入
样例输出
又是一道迪杰斯特拉的题。需要注意的是可能给出的可能是是重边
#include <iostream>
#include <cstdio>
using namespace std;
int ma[1005][1005];int vis[1005];int d[1005];
int n,t;
const int INF=999999;
void dj()
{
for(int i=1;i<=n;i++)
{
vis[i]=0;
d[i]=ma[1][i];
}
vis[1]=1;
for(int i=1;i<=n;i++)
{
int minn=INF;int temp;
for(int j=1;j<=n;j++)
if(!vis[j]&&d[j]<minn)
{
temp=j;
minn=d[j];
}
if(minn==INF)return ;
vis[temp]=1;
for(int j=1;j<=n;j++)
if(!vis[j]&&ma[temp][j]+d[temp]<d[j])
{
d[j]=ma[temp][j]+d[temp];
}
}
}
int main()
{
scanf("%d%d",&t,&n);
for(int i=0;i<1005;i++)
for(int j=0;j<1005;j++)
ma[i][j]=ma[j][i]=INF;
for(int i=0;i<t;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
ma[a][b]=ma[b][a]=min(c,ma[b][a]);
}
dj();
printf("%d\n",d
);
}
Bessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty sleep, so she wants to get back as quickly as possible.
Farmer John's field has N (2 <= N <= 1000) landmarks in it, uniquely numbered 1..N. Landmark 1 is the barn; the apple tree grove in which Bessie stands all day is landmark N. Cows travel in the field using T (1 <= T <= 2000) bidirectional cow-trails of various
lengths between the landmarks. Bessie is not confident of her navigation ability, so she always stays on a trail from its start to its end once she starts it.
Given the trails between the landmarks, determine the minimum distance Bessie must walk to get back to the barn. It is guaranteed that some such route exists.
输入
* Line 1: Two integers: T and N
* Lines 2..T+1: Each line describes a trail as three space-separated integers. The first two integers are the landmarks between which the trail travels. The third integer is the length of the trail, range 1..100.
输出
* Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
样例输入
5 5 1 2 20 2 3 30 3 4 20 4 5 20 1 5 100
样例输出
90
又是一道迪杰斯特拉的题。需要注意的是可能给出的可能是是重边
#include <iostream>
#include <cstdio>
using namespace std;
int ma[1005][1005];int vis[1005];int d[1005];
int n,t;
const int INF=999999;
void dj()
{
for(int i=1;i<=n;i++)
{
vis[i]=0;
d[i]=ma[1][i];
}
vis[1]=1;
for(int i=1;i<=n;i++)
{
int minn=INF;int temp;
for(int j=1;j<=n;j++)
if(!vis[j]&&d[j]<minn)
{
temp=j;
minn=d[j];
}
if(minn==INF)return ;
vis[temp]=1;
for(int j=1;j<=n;j++)
if(!vis[j]&&ma[temp][j]+d[temp]<d[j])
{
d[j]=ma[temp][j]+d[temp];
}
}
}
int main()
{
scanf("%d%d",&t,&n);
for(int i=0;i<1005;i++)
for(int j=0;j<1005;j++)
ma[i][j]=ma[j][i]=INF;
for(int i=0;i<t;i++)
{
int a,b,c;
scanf("%d %d %d",&a,&b,&c);
ma[a][b]=ma[b][a]=min(c,ma[b][a]);
}
dj();
printf("%d\n",d
);
}
相关文章推荐
- MFC消息处理时,双击鼠标左键响应单击左键消息的处理
- Android RecyclerView 使用完全解析 体验艺术般的控件
- 由内到外的螺旋矩阵
- Toolbar完整封装
- 深搜(DFS),Image Perimeters
- 虚拟机(CentOS) 桥接模式配置
- 面试中的一些问题——JAVA(三)
- 初入android之CheckBox
- 拆分链表
- 阿里巴巴 hr面
- 关于keyGenerator,KeyPairGenerator,SecretKeyFactory的解析
- 两步建立 ssh 反向隧道
- scapy实现一个端口扫描器(基于tcp三次握手扫描)——简析
- USACO2.3基础的算法题
- Eclipse中给jar包导入JavaDoc的方法
- 程序员的一生时间90%是用在编程上,而剩余的10%是活在世界上。
- Python中subprocess学习
- extern "C"什么意思
- C++ explicit关键字
- Java---软件试用次数(Properties类的简单使用)