Pagini recente » Cod sursa (job #2095943) | Cod sursa (job #846629) | Monitorul de evaluare | Statistici Mihnea Grigore (supermihnea420) | Cod sursa (job #1930668)
#include <iostream>
#include <fstream>
#include <vector>
#include <cwchar>
using namespace std;
ifstream in("bellmanford.in");
ofstream out("bellmanford.out");
const int NMax = 5e4 + 5;
const int inf = 1e9;
int N,M;
int dist[NMax];
struct elem {
int y,c;
elem() {}
elem(int a,int b) {
y = a;
c = b;
}
};
vector<elem> v[NMax];
int main() {
in>>N>>M;
for (int i=1;i<=M;++i) {
int x,y,c;
in>>x>>y>>c;
elem e(y,c);
v[x].push_back(e);
}
for (int i=2;i<=N;++i) {
dist[i] = inf;
}
bool update;
for (int cont=1;cont<=N;++cont) {
update = false;
for (int i=1;i<=N;++i) {
for (int j=0;j<v[i].size();++j) {
int next = v[i][j].y, cost = v[i][j].c;
if (dist[next] > dist[i] + cost) {
dist[next] = dist[i] + cost;
update = true;
}
}
}
}
if (update) {
out<<"Ciclu negativ!";
}
else {
for (int i=2;i<=N;++i) {
out<<dist[i]<<' ';
}
}
return 0;
}