问题:有边数限制且图中可能出现负权回路
思想:
根据循环的不断增加,来增加组合边数;(注意:每次循环时需要进行备份,来确保这次组合的其中一条边没有在这次组合中被更新过)
注:Dijkstra算法可理解为贪心;
bellman-ford类似dp;
代码实现:
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 510, M = 10010;
struct Edge
{
int a, b, c;
}edges[M];
int n, m, k;
int dist[N];
int last[N];
void bellman_ford()
{
memset(dist, 0x3f, sizeof dist);
dist[1] = 0;
for (int i = 0; i < k; i ++ )
{
memcpy(last, dist, sizeof dist);
//备份,防止下列更新中的dist[a]已经被更新过,从而导致无法保证dist[b]的结果是由i条边组成的;
for (int j = 0; j < m; j ++ )
{
auto e = edges[j];
dist[e.b] = min(dist[e.b], last[e.a] + e.c);
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < m; i ++ )
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
edges[i] = {a, b, c};
}
bellman_ford();
if (dist[n] > 0x3f3f3f3f / 2) puts("impossible");
else printf("%d\n", dist[n]);
return 0;
}