题目链接: https://www.patest.cn/contests/gplt/L2-001
dijkstra+记录路径
#include<bits/stdc++.h>
const int maxn =510;
const int inf=0x7FFFFF;
using namespace std;
typedef vector<int> VI;
int n,m,st,en,vis[maxn],team[maxn],dis[maxn],mp[maxn][maxn],shortdis,maxteam[maxn],pathcount[maxn],pre[maxn];
void dijkstra(int st){
dis[st]=0;
pathcount[st]=1;
maxteam[st]=team[st];
while(1){
int mint=inf,u;
for(int i=0;i<n;i++) if(vis[i]==0&&dis[i]<mint){mint=dis[i]; u=i;}
vis[u]=1;
if(u==en||mint==inf)break;
for(int v=0;v<n;v++){
if(vis[v]==0&&mp[u][v]!=inf){
if(dis[v]==dis[u]+mp[u][v]){
pathcount[v]+=pathcount[u];
if(maxteam[v]<maxteam[u]+team[v]){
maxteam[v]=maxteam[u]+team[v];
pre[v]=u;
}
}
else if(dis[v]>dis[u]+mp[u][v]){
pre[v]=u;
dis[v]=dis[u]+mp[u][v];
pathcount[v]=pathcount[u];
maxteam[v]=maxteam[u]+team[v];
}
}
}
}
}
VI print_path(int n){
VI Path;
while(n!=-1){ Path.push_back(n); n=pre[n];}
return Path;
}
int main(){
scanf("%d%d%d%d",&n,&m,&st,&en);
for(int i=0;i<n;i++)scanf("%d",&team[i]),pre[i]=-1,dis[i]=inf;
for(int i=0;i<n;i++)for(int j=0;j<n;j++)mp[i][j]=inf;
int a,b,c;
shortdis=inf;
for(int i=0;i<m;i++){
scanf("%d%d%d",&a,&b,&c); mp[a][b]=mp[b][a]=c;
}
dijkstra(st);
VI path;
path=print_path(en);
reverse(path.begin(),path.end());
printf("%d %d\n",pathcount[en],maxteam[en]);
printf("%d",path[0]);
for(int i=1;i<path.size();i++)printf(" %d",path[i]);
printf("\n");
return 0;
}