#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#define ElementType int
#define MaxVertexNum 501
#define INFINITY 1000000
using namespace std;
typedef struct GNode *PtrToGNode;
struct GNode{
int Nv;
int Ne;
ElementType G[MaxVertexNum][MaxVertexNum];
};
typedef PtrToGNode MGraph;
void DFS(int v,int end,int len,int pnum,MGraph Graph);
int visitDFS[501]={0};
int people[501]={0};
int cnt=0,num=0;
int n,m,c1,c2;
int minlen=INFINITY,templen=0;
int main() {
// insert code here...
MGraph Graph = (MGraph)malloc(sizeof(struct GNode));
//init
Graph->Nv=0;
Graph->Ne=0;
for (int i=0; i<MaxVertexNum; i++) {
for (int j=0; j<MaxVertexNum; j++) {
Graph->G[i][j] = INFINITY;
}
}
cin>>n>>m>>c1>>c2;
Graph->Nv = n;
Graph->Ne = m;
for (int i=0; i<n; i++) {
cin>>people[i];
}
for (int i=0; i<Graph->Ne; i++) {
int row,col,len;
scanf("%d %d %d",&row,&col,&len);
Graph->G[row][col]=len;
Graph->G[col][row]=len;
}
DFS(c1,c2,0,people[c1], Graph);
cout<<cnt<<" "<<num;
return 0;
}
void DFS(int v,int end,int len,int pnum,MGraph Graph){
if (v==end) {
if (minlen == len) {
cnt++;
if (num<pnum) {
num = pnum;
}
}
if (minlen>len) {
minlen = len;
cnt=1;
num = pnum;
//printf("debug:minlen =%d\n ",minlen);
}
return;
}
if (len>minlen) {
return;
}
visitDFS[v]=1;
for (int i = 0; i<Graph->Nv; i++) {
if (Graph->G[v][i]!=INFINITY&&!visitDFS[i]) {
DFS(i,end,len+Graph->G[v][i], pnum+people[i], Graph);
}
}
visitDFS[v]=0;
}
PAT甲级 1003
猜你喜欢
转载自blog.csdn.net/ken_for_learning/article/details/78344010
今日推荐
周排行