备战天梯赛——紧急救援（25分）

紧急救援 (25 分)

代码：
#include
#include
#include
#include

using namespace std;
const int MAX = 2000000;
class node
{
public:
int v;
int weight;
};
map<int, vector>graph;
vectorsoilder;
int dis[MAX];
int book[MAX];
int vis[MAX];
int road[MAX];
int ress[MAX];
int q = 0;
int qs = 0;
int len = 0;
int cishu = 0;
int sum = 0;
int res = -1;

void dfs(int s, int d, int minn)
{
if (len > minn)return;
if (s == d && len == minn)
{
cishu++;
if (res < sum)
{
res = sum;
qs = q;
for (int i = 1;i <= q;i++)
{
ress[i] = road[i];
}
}

}
else
{
	vector<node>::iterator a = graph[s].begin();
	for (;a != graph[s].end();a++)
	{
		if (vis[a->v] == 0)
		{
			road[++q] = a->v;
			len += a->weight;
			sum += soilder[a->v];
			vis[a->v] = 1;
			dfs(a->v, d, minn);
			len -= a->weight;
			sum -= soilder[a->v];
			q--;
			vis[a->v] = 0;
		}
	}

}

}
int main()
{
int n, m, s, d;
cin >> n >> m >> s >> d;
for (int i = 0;i < n;i++)
{
int temp;
cin >> temp;
soilder.push_back(temp);
}
for (int i = 0;i < m;i++)
{
int u, v, w;
cin >> u >> v >> w;
node temp;
temp.v = v;
temp.weight = w;
graph[u].push_back(temp);
node temp1;
temp1.v = u;
temp1.weight = w;
graph[v].push_back(temp1);

}
for (int i = 0;i < n;i++)
{
	dis[i] = MAX;
}
dis[s] = 0;
book[s] = 1;
vector<node>::iterator a;
a = graph[s].begin();
for (;a != graph[s].end();a++)
{
	dis[a->v] = a->weight;
}
for (int i = 0;i < n - 1;i++)
{

	int t = MAX;
	int v = -1;
	for (int i = 0;i < n;i++)
	{
		if (book[i] == 0 && dis[i] < t)
		{
			t = dis[i];
			v = i;
		}
	}
	book[v] = 1;
	vector<node>::iterator a;
	a = graph[v].begin();
	for (;a != graph[v].end();a++)
	{
		if ((t + a->weight) < dis[a->v])
		{
			dis[a->v] = t + a->weight;
		}
	}
}
int minn = dis[d];
ress[0] = s;
vis[s] = 1;
sum += soilder[s];
dfs(s, d, minn);

cout << cishu << " " << res << endl;
for (int i = 0;i <= qs;i++)
{
	if (i == 0)cout << ress[i];
	else
		cout << " " << ress[i];
}

}