Cod sursa(job #1192761)

Utilizator Darius15Darius Pop Darius15 Data 29 mai 2014 19:04:00
Problema Algoritmul Bellman-Ford Scor 15
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <fstream>

using namespace std;

struct il
{
    int l,c,cost;
};
il a[250001];
int n,m,v[50001],x,y,cost,i,j;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
int main()
{
    f>>n>>m;
    for (i=1; i<=n; i++)
        v[i]=1<<31-1;
    v[1]=0;
    for (i=1; i<=m; i++)
        f>>x>>y>>cost,
        a[i].l=x,a[i].c=y,a[i].cost=cost;
    for (i=1; i<=n-1; i++)
    {
        for (j=1; j<=m; j++)
            if (v[a[j].l]+a[j].cost<v[a[j].c])
                v[a[j].c]=v[a[j].l]+a[j].cost;
    }
    for(i=2;i<=n;i++)
    g<<v[i]<<' ';
    return 0;
}