pat-A 1003 回溯+剪枝

#include<iostream>

#include<cstdio>
#include<queue>
#include<vector>
#include<algorithm>
#include<set>
#include<stack>
#include<cmath>
#include<cstring>
#include<string>
#include <iostream>
#include <cstdio>
#include<climits>
using namespace std;
int mp[510][510];
int visited[510];
int minst=100000000;
int maxeg = 0;
int cnt = 0;
vector<int> edge;
int n;
void solver(int cur,int end,int st,int cou){
if (cur == end)
{
if (st < minst)
{
cnt = 1;
minst = st;
maxeg = cou;
return;
}
else if(st==minst){
++cnt;
if (cou > maxeg)
maxeg = cou;
return;
}
}
if (st > minst)
{
return;
}
int i;
for ( i = 0; i < n; i++){
if (mp[cur][i] != 0 && !visited[cur]){
visited[cur] = 1;
solver(i, end, st + mp[cur][i], cou + edge[i]);
visited[cur] = 0;
}
}
}
int main(){
int  m, c1, c2;
cin >> n >> m >> c1 >> c2;

for (int i = 0; i < n; i++){
edge.push_back(0);
cin >> edge[i];
}
for (int i = 0; i < m; i++){
int a, b,d;
cin >> a >> b>>d;
mp[a][b] = d;
mp[b][a] = d;

}
solver(c1,c2,0,edge[c1]);
cout << cnt <<" "<< maxeg<<endl;
return 0;
}