PAT A1003注意点

始终注意i是什么，警惕下面这种错误！！！

for (int i = 0; i < temppath.size(); i++) {
	numteam += weight[temppath[i]];//这里要注意，不是+=weight[i]!!!
}

#include<iostream>
#include<vector>
#include<cstring>
#include<algorithm>
#include<map>
#include<queue>
#include<math.h>
using namespace std;

const int inf = 1e9;
const int maxn = 505;
int n, m, c1, c2;
int g[maxn][maxn];
int weight[maxn];
bool vi[maxn];
int d[maxn];
vector<int >pre[maxn];
vector<int> temppath, path;
int numpath = 0;
int maxteam;

void dfs(int s) {
	if (s == c1) {
		numpath++;
		temppath.push_back(s);
		int numteam=0;
		for (int i = 0; i < temppath.size(); i++) {
			numteam += weight[temppath[i]];//这里要注意，不是+=weight[i]!!!
		}
		if (numteam > maxteam) {
			maxteam = numteam;
			path = temppath;
		}
		temppath.pop_back();
		return;
	}
	temppath.push_back(s);
	for (int i = 0; i < pre[s].size(); i++) {
		dfs(pre[s][i]);
	}
	temppath.pop_back();
}

void dj(int s) {
	fill(d, d + maxn, inf);
	d[s] = 0;
	for (int i = 0; i < n; i++) {
		int u = -1, minn = inf;
		for (int j = 0; j < n; j++) {
			if (d[j] < minn && !vi[j]) {
				u = j;
				minn = d[j];
			}
		}
		if (u == -1)return;
		vi[u] = true;
		for (int v = 0; v < n; v++) {
			if (!vi[v] && g[u][v] != inf) {
				if (d[u] + g[u][v] < d[v]) {
					d[v] = d[u] + g[u][v];
					pre[v].clear();
					pre[v].push_back(u);
				}
				else if (d[u] + g[u][v] == d[v]){
					pre[v].push_back(u);
				}
			}
		}
	}
}

int main() {
	freopen("input.txt", "r", stdin);
	fill(g[0], g[0] + maxn * maxn, inf);

	cin >> n >> m >> c1 >> c2;
	for (int i = 0; i < n; i++) {
		scanf("%d", &weight[i]);
	}
	for (int i = 0; i < m; i++) {
		int x, y, l;
		cin >> x >> y >> l;
		g[x][y] = g[y][x] = l;
	}
	dj(c1);
	dfs(c2);

	cout << numpath << " " << maxteam;
	return 0;
}