Pagini recente » Cod sursa (job #1483145) | Cod sursa (job #1424353) | Cod sursa (job #2523076) | Cod sursa (job #200557) | Cod sursa (job #1647039)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
#define inf 200000000
vector <int> A[50001];
vector <int> C[50001];
int d[50001];
int n, m;
int main()
{
int i, j, k, x, y, c;
f >> n >> m;
for( i = 1; i <= m; i++ ){
f >> x >> y >> c;
A[x].push_back(y);
C[x].push_back(c);
}
for( i = 1; i <= n; i++ )
d[i] = inf;
d[1] = 0;
for( i = 1; i <= n - 1; i++ )
for( j = 1; j <= n; j++ )
for( k = 0; k < A[j].size(); k++ )
if( d[j] != inf && d[A[j][k]] > d[j] + C[j][k] )
d[A[j][k]] = d[j] + C[j][k];
for( j = 1; j <= n; j++ )
for( k = 0; k < A[j].size(); k++ )
if( d[j] != inf && d[A[j][k]] > d[j] + C[j][k] ){
g << "Ciclu negativ!";
return 0;
}
for( i = 2; i <= n; i++ )
g << d[i] << " ";
return 0;
}