描述:
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
复制
注释:
INPUT DETAILS:
There are five landmarks.
OUTPUT DETAILS:
Bessie can get home by following trails 4, 3, 2, and 1.
一开始我的代码,关于范围的选定要细心,不能出错,并且对于一些细节要放慢脚步进行分析与理解,在多方位的进行分析,代码的数据要清晰,尽量不要用一个字符来代替,不然到最后自己都不知到是什么,关于写子函数,能不写就不写,除非数据过大,函数一个不行,并且涉及到了递归那方面。
#include<iostream>
#include<vector>
using namespace std;
const long long INF=0x3FFFFF;
int T,M;
int sum1,sum2,sum3;
struct Step
{
int length,endi;
Step(int ll,int ee):length(ll),endi(ee){}
};
int main()
{
cin>>T>>M;
vector<vector<Step> > q(M+1,vector<Step>{});
vector<int> result(M+1,INF);
vector<int> visited(M+1,0);
for(int n=0;n<T;n++)
{
cin>>sum1>>sum2>>sum3;
q[sum1].push_back(Step(sum3,sum2));
q[sum2].push_back(Step(sum3,sum1));
}
result[1]=0;
for(int n=0;n<q[1].size();n++)
{
if(result[q[1][n].endi]>q[1][n].length)
result[q[1][n].endi]=q[1][n].length;
}
visited[1]=1;
while(true)
{
int mini=INF,t;
for(int n=1;n<=M;n++)
{
if(result[n]<mini&&!visited[n])
{
mini=result[n];
t=n;
}
}
if(mini==INF)break;
visited[t]=1;
for(int n=0;n<q[t].size();n++)
{
if(result[q[t][n].endi]>result[t]+q[t][n].length)
{
result[q[t][n].endi]=result[t]+q[t][n].length;
}
}
}
cout<<result[M]<<endl;
return 0;
}
#include<iostream>
#include<string.h>
#include<vector>
#define INF 1<<30
using namespace std;
int N,M;
struct point
{
int w,no;
point(int ee,int ll):w(ee),no(ll){}
};
void dijkstra(int start,vector<vector<point> >& map)
{
vector<int> dis(M+1,INF);
vector<int> visited(M+1,0);
dis[start]=0;
for(int m=0;m<map[start].size();m++)
{
dis[map[start][m].no]=map[start][m].w;
}
while(true)
{
int v,min=INF;
for(int m=1;m<=M;m++)
{
if(dis[m]<min&&visited[m]==0)
{
min=dis[m];
v=m;
}
}
if(min==INF)
break;
visited[v]=1;
for(int m=0;m<map[v].size();m++)
{
if(dis[map[v][m].no]>dis[v]+map[v][m].w)
{
dis[map[v][m].no]=dis[v]+map[v][m].w;
}
}
}
cout<<dis[M]<<endl;
}
int main() {
cin >> N >> M ;
vector< vector<point> > map(M+1, vector<point>());
for(int n=0;n<N;n++)
{
int sum1,sum2,sum3;
cin>>sum1>>sum2>>sum3;
map[sum1].push_back(point(sum3,sum2));
map[sum2].push_back(point(sum3,sum1));
}
dijkstra(1,map);
return 0;
}
应为有些编译器对于这类代码不能识别,会进行报错,所以也可以用数组的方法来写,则这样就不会报错了。
#include<iostream>
using namespace std;
const int Max = 0x3fffffff;
int map[1005][1005], dis[1005];
void dijkstra(int n)
{
int visit[1001] = { 0 }, min, i, j, k;
visit[1] = 1;
for (i = 1; i < n; ++i)
{
min = Max;
k = 1;
for (j = 1; j <= n; ++j)
{
if (!visit[j] && min > dis[j])
{
min = dis[j];
k = j;
}
}
visit[k] = 1;
for (j = 1; j <= n; ++j)
{
if ( dis[j] > dis[k] + map[k][j])
dis[j] = dis[k] + map[k][j];
}
}
cout<<dis[n]<<endl;
}
int main()
{
int t, n, i, j, from, to, cost;
while (cin>>t>>n)
{
for (i = 1; i <= n; ++i)
{
map[i][i] = 0;
for (j = 1; j < i; ++j)
map[i][j] = map[j][i] = Max;
}
for (i = 1; i <= t; ++i)
{
cin>>from>>to>>cost;
if (cost < map[from][to]) //可能有多条路,只记录最短的
map[from][to] = map[to][from] = cost;
}
for (i = 1; i <= n; ++i)
dis[i] = map[1][i];
dijkstra(n);
}
}