Pagini recente » Cod sursa (job #782103) | Cod sursa (job #3156347) | Cod sursa (job #2669288) | Cod sursa (job #2153705) | Cod sursa (job #2767474)
#include <fstream>
#include <vector>
using namespace std;
struct Tuple
{
int first, second, third;
};
const int Nmax = 50000;
const int INF = (1 << 30);
int dist[Nmax + 1];
bool viz[Nmax + 1];
vector <Tuple> edges;
int main()
{
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, m;
fin >> n >> m;
for (int i = 1; i <= m; i++)
{
int u, v, w;
fin >> u >> v >> w;
edges.push_back({u, v, w});
}
for (int i = 1; i <= Nmax; i++)
{
dist[i] = INF;
}
dist[1] = 0;
for (int i = 1; i <= n; i++)
{
for (auto e : edges)
{
int a = e.first, b = e.second, c = e.third;
if (dist[a] + c < dist[b])
{
if (i == n)
{
fout << "Ciclu negativ!";
return 0;
}
dist[b] = dist[a] + c;
}
}
}
for (int i = 2; i <= n; i++)
{
fout << dist[i] << " ";
}
return 0;
}