Cod sursa(job #1892096)

Utilizator JokerOsHreceniuc Cristian JokerOs Data 24 februarie 2017 17:48:53
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <fstream>

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

#define maxn 50010
#define maxm 250010
#define inf 10000000

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

long n, m, i, j, k, cost[maxn];

void init()
{
    long i;
    cost[1]=0;
    for(i=2; i<=n; i++)
        cost[i]=inf;
}

void solve()
{
    long i, j;
    for(i=1; i<=n; i++)
        for(j=1; j<=m; j++)
            if(cost[e[j].a]+e[j].c<cost[e[j].b])
                cost[e[j].b]=cost[e[j].a]+e[j].c;
}

long check_negativ()
{
    long i;
    for(i=1; i<=m; i++)
        if(cost[e[i].a]+e[i].c<cost[e[i].b])
            return 1;
    return 0;
}

int main()
{
    f>>n>>m;
    for(i=1; i<=m; i++)
        f>>e[i].a>>e[i].b>>e[i].c;
    init();
    solve();
    if(check_negativ())
    {
        g<<"Ciclu negativ!";
        return 0;
    }
    for(i=2; i<=n; i++)
        g<<cost[i]<<" ";
    return 0;
}