Pagini recente » Cod sursa (job #1010795) | Cod sursa (job #2858022) | Cod sursa (job #479074) | Cod sursa (job #983182) | Cod sursa (job #1467644)
# include <bits/stdc++.h>
using namespace std;
ifstream fi("bellmanford.in");
ofstream fo("bellmanford.out");
int a[255555];
int b[255555];
int c[255555];
int d[50005];
int main(void)
{
int n,m;
fi>>n>>m;
for (int i = 1;i <= m;++i)
fi>>a[i]>>b[i]>>c[i];
for (int i = 2;i <= n;++i) d[i] = 2e9;
for (int k = 1;k <= n;++k)
{
for (int i = 1;i <= m;++i)
if (d[b[i]] > d[a[i]] + c[i])
d[b[i]] = d[a[i]] + c[i];
}
for (int i = 1;i <= m;++i)
if (d[b[i]] > d[a[i]] + c[i])
return fo << "Ciclu negativ!\n",0;
for (int i = 2;i <= n;++i) fo << d[i] << ' ';
fo << '\n';
return 0;
}