Pagini recente » Cod sursa (job #892877) | Cod sursa (job #1853267) | Cod sursa (job #2790067) | Cod sursa (job #93893) | Cod sursa (job #2717112)
#include<fstream>
using namespace std;
ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
pair<int, pair<int, int>> muchi[250001]; /// const, nod1, nod2
long long dmin[50001];
int main()
{
int n, m;
cin>>n>>m;
dmin[1] = 0;
for(int i=2; i<=n; i++)
{
dmin[i] = 1e18;
}
for(int i=1; i<=m; i++)
{
int x, y, c;
cin>>x>>y>>c;
muchi[i].first = c;
muchi[i].second.first = x;
muchi[i].second.second = y;
}
for(int i=1; i<n; i++)
{
for(int j=1; j<=m; j++)
{
int x, y, c;
c = muchi[j].first;
x = muchi[j].second.first;
y = muchi[j].second.second;
if(dmin[x] + c < dmin[y])
dmin[y] = dmin[x] + c;
}
}
bool pp = 0;
for(int j=1; j<=m && pp==0; j++)
{
int x, y, c;
c = muchi[j].first;
x = muchi[j].second.first;
y = muchi[j].second.second;
if(dmin[x] + c < dmin[y])
pp = 1;
}
if(pp == 1)
cout<<"Ciclu negativ!";
else
{
for(int i=2; i<=n; i++)
cout<<dmin[i]<<" ";
}
return 0;
}