1003 Emergency (25分)

#include<iostream>
#include<string.h>
#include<set>
#include<queue>
#include<map>
#include<cctype>
#include<vector>
#include<stdlib.h>
#include<algorithm>
#include<cmath>
using namespace std;
int cnum;
int rnum;
int start,end1;
int road[510][510];
vector<int> cteam;//vector定义在全局变量时不能用未赋值的变量声明大小，可以cteam.resize(cnum);
int minlen=-1,maxteam=0;
int totalnum=0;
bool getcity[510]={false};
void dfs(int s,int len,int team)
{
    if(minlen>0 && len>minlen)
        return;
    if(s==end1)
    {
        if(minlen<0||len<minlen)
        {
            minlen=len;
            maxteam=team;
            totalnum=1;
        }
        else if(len==minlen)
        {
            totalnum++;
            if(maxteam<team)
                maxteam=team;
        }
    }
    for(int i=0;i<cnum;i++)
    {
        if(road[s][i]>0 && getcity[i]==false)
        {
            getcity[i]=true;
            dfs(i,len+road[s][i],team+cteam[i]);
            getcity[i]=false;
        }
    }
    return;
}
int main()
{
    cin>>cnum>>rnum>>start>>end1;
    cteam.resize(cnum);
    for(int i=0;i<cnum;i++)
        cin>>cteam[i];
    int a,b;
    for(int i=0;i<rnum;i++)
    {
        cin>>a>>b;
        cin>>road[a][b];
        road[b][a]=road[a][b];
    }
    getcity[start]=true;
    dfs(start,0,cteam[start]);
    cout<<totalnum<<" "<<maxteam<<endl;
    
    return 0;
}