Pagini recente » Cod sursa (job #418722) | Cod sursa (job #2874524) | Cod sursa (job #739675) | Cod sursa (job #1550859) | Cod sursa (job #3039136)
#include <fstream>
using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int n,m,x[250003],y[250003],c[250003],t[50003],dist[50003];
const int inf=2e9;
int main()
{
int i,j,x1,x2,cost;
f >> n >> m;
for (i=1;i<=m;i++)
f >> x[i] >> y[i] >> c[i];
for (i=1;i<=n;i++)
{
dist[i]=inf;
t[i]=0;
}
dist[1]=0;
for (i=1;i<n;i++)
for (j=1;j<=m;j++)
if (dist[y[j]]>dist[x[j]]+c[j])
{
dist[y[j]]=dist[x[j]]+c[j];
t[y[j]]=x[j];
}
for (i=1;i<=m;i++)
if (dist[y[i]]>dist[x[i]]+c[i])
{
g << "Ciclu negativ!";
return 0;
}
for (i=2;i<=n;i++)
g << dist[i] << ' ';
return 0;
}