Cod sursa(job #2181188)

Utilizator UnseenMarksmanDavid Catalin UnseenMarksman Data 21 martie 2018 15:11:43
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#include <vector>
#define N 50005
#define M 250005
#define Inf 1<<30

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

long n, m, d[N];

struct muchie{
    long a,b,c;
}e[M];

int main()
{
    int a,b,c;

    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>e[i].a>>e[i].b>>e[i].c;
    }

    for(int i=2; i<=n; i++)
        d[i]=Inf;

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(d[e[j].a]+e[j].c<d[e[j].b])
            {
                d[e[j].b]=d[e[j].a]+e[j].c;
            }
        }
    }
    for(int j=1; j<=m; j++)
    {
        if(d[e[j].a] + e[j].c < d[e[j].b])
        {
            fout<<"Ciclu negativ!";
            return 0;
        }
    }
    for(int i=2; i<=n; i++)
        fout<<d[i]<<' ';

    return 0;
}