Pagini recente » Cod sursa (job #674004) | Cod sursa (job #1606157) | Cod sursa (job #41449) | Cod sursa (job #2984885) | Cod sursa (job #2341925)
//#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
vector<pair<int,int> > v[50005];
int f[500005],f1[500005];
long long infi=99999999999;
int main()
{
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
int n,m,a,b,c;
cin>>n>>m;
for(int i=1;i<=m;i++){
cin>>a>>b>>c;
v[a].push_back(make_pair(b,c));
}
for(int i=2;i<=n;i++){
f[i]=infi;
}
for(int k=1;k<=n-1;k++){
for(int i=1;i<=n;i++){
if(f[i]!=infi){
for(auto it:v[i])
if(f[i]+it.second<f[it.first]){
f[it.first]=it.second+f[i];
}
}
}
}
for(int i=1;i<=n;i++)
f1[i]=f[i];
for(int i=1;i<=n;i++){
if(f[i]!=infi){
for(auto it:v[i])
if(f[i]+it.second<f[it.first]){
f[it.first]=it.second+f[i];
}
}
}
for(int i=1;i<=n;i++){
if(f[i]!=f1[i]){
cout<<"Ciclu negativ!";
return 0;
}
}
for(int i=2;i<=n;i++)
cout<<f[i]<<" ";
return 0;
}