Cod sursa(job #2083970)

Utilizator gapdanPopescu George gapdan Data 8 decembrie 2017 13:42:29
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <cstdio>
 
using namespace std;
 
#define NMAX 50010
#define MMAX 250010
#define inf 1000000000
 
struct muchie
{
    int a, b, c;
} e[MMAX];
 
int n, m, i, j, k, cost[NMAX];
 
void init()
{
    int i;
    cost[1]=0;
    for(i=2; i<=n; i++)
        cost[i]=inf;
}
 
 int check_negativ()
{
    int 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()
{
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i=1; i<=m; i++)
        scanf("%d%d%d", &e[i].a, &e[i].b, &e[i].c);
    init();
    int 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;
    /*if(check_negativ())
    {
        printf("Ciclu negativ!\n");
        return 0;
    }*/
    for(i=2; i<=n; i++)
        if (cost[i] != inf) printf("%d ", cost[i]);
			else printf("0 ");
    return 0;
}