Pagini recente » Cod sursa (job #2331481) | Cod sursa (job #2460705) | Cod sursa (job #1030276) | Cod sursa (job #501502) | Cod sursa (job #1096502)
#include<cstdio>
#include<vector>
using namespace std;
#define INF 0x3f3f3f3f
vector < pair <int,int> > v[50005];
int n,m,nr,x,y,c,D[50005];
bool ok=true;
int main()
{
int i,j;
freopen("bellmanford.in","r",stdin);
freopen("bellmanford.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=2;i<=n;++i)
D[i]=INF;
for (i=1;i<=m;++i)
{
scanf("%d%d%d",&x,&y,&c);
v[x].push_back(make_pair(y,c));
if (x==1) D[y]=c;
}
while (ok)
{
++nr;
ok=false;
for (i=2;i<=n;++i)
for (j=0;j<v[i].size();++j)
if (D[v[i][j].first]>D[i]+v[i][j].second)
{
ok=true;
D[v[i][j].first]=D[i]+v[i][j].second;
}
if (nr>=n) ok=false;
}
if (nr>=n)
printf("Ciclu negativ!\n");
else
{
for (i=2;i<=n;++i)
printf("%d ",D[i]);
printf("\n");
}
return 0;
}