bellman_ford 算法,用于计算有负边权的最短路,时间复杂度为O(mn)。
#include<bits/stdc++.h>
using namespace std;
const int N=505,M=1e4+5;
struct node
{
int from,to,dis;
}edge[M];
int dist[N],backup[N];
int n,m,k;
int bellman_ford()
{
memset(dist,0x3f,sizeof dist);
dist[1]=0;
for(int j=0;j<k;j++)
{
memcpy(backup,dist,sizeof dist);
for(int i=1;i<=m;i++)
{
int a=edge[i].from,b=edge[i].to,c=edge[i].dis;
dist[b]=min(dist[b],backup[a]+c);
}
}
if(dist[n] > 0x3f3f3f3f/2)
return 0;
return dist[n];
}
int main()
{
scanf("%d%d%d",&n,&m,&k);
for(int i=1;i<=m;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
edge[i]={x,y,z};
}
int t=bellman_ford();
if(t==0) puts("impossible");
else cout<<t<<endl;
}