Pagini recente » Cod sursa (job #1332641) | Cod sursa (job #3173336) | Cod sursa (job #1238217) | Cod sursa (job #992060) | Cod sursa (job #2301944)
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define inf 250000010
#define f first
#define s second
#define lung long long
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
vector < pair<lung,lung> > v[50010];
queue < pair<lung,lung> > q;
pair <lung,lung> p;
lung rez[50010],N,M,viz[50010],ok;
int main()
{
int x,y,c,i;
fin>>N>>M;
for(i=1; i<=M; i++)
{
fin>>x>>y>>c;
v[x].push_back(make_pair(c,y));
}
for(i=1; i<=N; i++)
{
rez[i]=inf;
viz[i]=0;
}
rez[1]=0;
for(auto it:v[1])
{
q.push(it);
}
ok=0;
while(!q.empty()&&ok==0)
{
p=q.front();
q.pop();
if(p.f<rez[p.s])
{
rez[p.s]=p.f;
viz[p.s]++;
if(viz[p.s]!=N)
{
for(auto it:v[p.s])
q.push(make_pair(p.f+it.f,it.s));
}
else
{
ok=1;
}
}
}
if(ok==1)
fout<<"Ciclu negativ!";
else
{
for(i=2;i<=N;i++)
fout<<rez[i]<<" ";
}
}