POJ 2387
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.
Input
-
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.
Output
- Line 1: A single integer, the minimum distance that Bessie must travel to get from landmark N to landmark 1.
Sample Input
5 5
1 2 20
2 3 30
3 4 20
4 5 20
1 5 100Sample Output
90Hint
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
第一行输入 n, m表示有 n条路,从点 m到点1
单源最短路径问题。
题目是要求从 m到1的距离,可以先求1到所有点的距离,然后再输出1到 m的距离就行了。
这题主要是靠算法,记住就行了。
#include<algorithm>
#include <iostream>
using namespace std;
int MAX = 99999;
int u, v, n, dis[1005], vis[1005], map[1005][1005];
void dijk()
{
int k, mini;
for (int i = 1; i <= v; i++)
{
dis[i] = map[1][i];
}
vis[1] = 1;
for (int i = 1; i < v; i++)
{
mini = MAX;
for (int j = 1; j <= v; j++)
{
if (!vis[j] && dis[j] < mini)
{
mini = dis[j];
k = j;
}
}
vis[k] = 1;
for (int j = 1; j <= v; j++)
{
if (dis[j] > dis[k] + map[k][j])
{
dis[j] = dis[k] + map[k][j];
}
}
}
}
int main()
{
while (cin >> u >> v)
{
n = 0;
for (int i = 0; i <= v; i++)
{
for (int j = 0; j <= v; j++)
{
map[i][j] = MAX;
}
map[i][i] = 0;
vis[i] = 0;
dis[i] = MAX;
}
for (int i = 1; i <= u; i++)
{
int a, b, len;
cin >> a >> b >> len;
n = max(max(n, a), b);
if (map[a][b] > len)
{
map[a][b] = map[b][a] = len;
}
}
dijk();
cout << dis[v];
}
return 0;
}
起点为u
int MAX = 0x3f3f3f3f;
int u, v, n, dis[1005], vis[1005], map[1005][1005];
void dijk(int u)
{
memset(vis,0,sizeof(vis));
int k, mini;
for (int i = 1; i <= n; i++)
{
dis[i] = map[u][i];
}
vis[u] = 1;
for (int i = 1; i < n; i++)
{
mini = MAX;
for (int j = 1; j <= n; j++)
{
if (!vis[j] && dis[j] < mini)
{
mini = dis[j];
k = j;
}
}
vis[k] = 1;
for (int j = 1; j <= n; j++)
{
if (dis[j] > dis[k] + map[k][j])
{
dis[j] = dis[k] + map[k][j];
}
}
}
}