地址:http://pat.zju.edu.cn/contests/pat-a-practise/1003
思路:经典的 dfs + 回溯
每个节点 i 是否访问用visited[ i ] 来存储
每个节点 i 救援队伍人数用teams[ i ] 来存储
节点 i 到节点 j 的距离用 map[i][j] 存储
minlen 记录最短距离, minnum记录最短距离的个数,maxcost记录最短距离中的最大救援队伍。
vec来按序存储构成最短距离的节点
dfs中的pathsum是记录vec中所有节点的距离,也就是有可能是我们要求的minlen。
思路是深度遍历,直到搜寻到结束节点ending,每次深度遍历回退的时候,vec要pop_back, visited 的那个回退节点重置为0, pathsum也要减掉当前节点和回退节点的路径长。这几个变量(vec, visited, pathsum)都是手段,重要的是记录minlen, minnum和maxcost。
参考代码:
#include<cstdio>
#include<vector>
#include<numeric>
using namespace std;
int cities, roads, start, ending, teams[501], map[501][501], visited[501];
unsigned int minlen = -1, minnum = 0, maxcost = 0;
vector<int>vec;
void init()
{
scanf("%d %d %d %d", &cities, &roads, &start, &ending);
for(int i = 0; i < cities; ++i)
{
scanf("%d", teams+i);
}
int a, b, num;
for(int i = 0; i < roads; ++i)
{
scanf("%d %d %d", &a, &b, &num);
map[a][b] = map[b][a] = num;
}
}
void dfs(int start, int pathsum, vector<int>& v)
{
if(start == ending)
{
if(pathsum < minlen)
{
minlen = pathsum;
maxcost = 0;
minnum = 1;
for(int i=0; i<v.size(); ++i)
{
maxcost += teams[v[i]];
}
}
else if(pathsum == minlen)
{
++minnum;
int nowcost = 0;
for(int i=0; i<v.size(); ++i)
{
nowcost += teams[v[i]];
}
maxcost = maxcost < nowcost ? nowcost : maxcost;
}
}
else
{
for(int i = 0; i < cities; ++i)
{
if(i != start && visited[i] == 0 && map[start][i] > 0 )
{
visited[i] = 1;
pathsum += map[start][i];
v.push_back(i);
dfs(i, pathsum, v);
v.pop_back();
pathsum -= map[start][i];
visited[i] = 0;
}
}
}
}
int main()
{
init();
visited[start] = 1;
vec.push_back(start);
int path = 0;
dfs(start, path, vec);
printf("%d %d\n", minnum, maxcost);
return 0;
}