Cod sursa(job #1397423)

Utilizator rangerChihai Mihai ranger Data 23 martie 2015 15:17:19
Problema Algoritmul Bellman-Ford Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.03 kb
#include<fstream>
#include<vector>
#include<queue>

using namespace std;

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");

const int  N = 50003;
const int inf = 1e9;

#define pb push_back
#define mp make_pair

int n,m,i,a,b,c;
vector< pair<int, int> > g[N];
vector<int> d(N,inf);
vector<int> V(N,0);
queue<int> q;

int main()
{
    cin>>n>>m;
    while (m--)
    {
        cin>>a>>b>>c;
        g[a].pb(mp(b,c));
    }
    d[1]=0;
    V[1]=1;
    q.push(1);
    while (q.size())
    {
        int v=q.front();
        q.pop();
        for (i=0;i<g[v].size();i++)
        {
            int to=g[v][i].first,len=g[v][i].second;
            if (d[to]>d[v]+len)
            {
                ++V[to];
                if (V[to]==n)
                {
                    cout<<"Ciclu negativ!";
                    return 0;
                }
                d[to]=d[v]+len;
                q.push(to);
            }
        }
    }
    for (i=2;i<=n;i++)cout<<d[i]<<' ';
    return 0;
}