注意点:
1. 简单的最短路径题目,一般这种题目必定有的数据结构为
int G[MAXLEN][MAXLEN];
int D[MAXLEN];
int visit[MAXLEN];
2. 这道题需要再增加teamNum[MAXLEN], pathNum[MAXLEN]两个数组来存储结果。
3. 每次更新D时,需要根据相等还是<分两种不同情况考虑来更行D, teamNum, pathNum.
4. 起点终点相同时额外考虑
代码如下:
#include <iostream>
#include <string.h>
#include <stack>
#include <math.h>
#include <vector>
#include <algorithm>
#define MAXNUM 0x3f3f3f3f
#define MAXLEN 501
#define STARTTIME 8 * 60 * 60
#define ENDTIME 21 * 60 * 60
#define max(a, b) (((a) > (b)) ? (a) : (b))
using namespace std;
int G[MAXLEN][MAXLEN];
int visit[MAXLEN];
int D[MAXLEN];
int teams[MAXLEN];
int teamNum[MAXLEN];
int pathNum[MAXLEN];
int N, M, c1, c2;
int main()
{
int i, j;
int x, y, len;
int minIndex, minValue;
scanf("%d %d %d %d", &N, &M, &c1, &c2);
for(i = 0; i < N; ++ i)
scanf("%d", &teams[i]);
memset(G, MAXNUM, sizeof(G));
for(i = 0; i < M; ++ i)
{
scanf("%d %d %d", &x, &y, &len);
G[x][y] = G[y][x] = len;
}
if(c1 == c2)
{
printf("1 %d", teams[c1]);
return 0;
}
fill_n(visit, N, 0);
fill_n(teamNum, N, 0);
fill_n(pathNum, N, 0);
visit[c1] = 1;
for(i = 0; i < N; ++ i)
{
D[i] = G[c1][i];
if(D[i] != MAXNUM)
{
teamNum[i] = teams[c1] + teams[i];
pathNum[i] = 1;
}
}
for(i = 0; i < N - 1; ++ i)
{
minValue = MAXNUM;
minIndex = -1;
for(j = 0; j < N; ++ j)
{
if(D[j] < minValue && !visit[j])
{
minValue = D[j];
minIndex = j;
}
}
if(minIndex == c2)
break;
visit[minIndex] = 1;
for(j = 0; j < N; ++ j)
{
if(D[minIndex] + G[minIndex][j] < D[j] && !visit[j])
{
teamNum[j] = teamNum[minIndex] + teams[j];
D[j] = D[minIndex] + G[minIndex][j];
pathNum[j] = pathNum[minIndex];
}
else if(D[minIndex] + G[minIndex][j] == D[j] && !visit[j])
{
if(teamNum[minIndex] + teams[j] > teamNum[j])
teamNum[j] = teamNum[minIndex] + teams[j];
pathNum[j] += pathNum[minIndex];
}
}
}
printf("%d %d", pathNum[c2], teamNum[c2]);
return 0;
}