Cod sursa(job #2855419)

Utilizator temuscDrumea Matei temusc Data 22 februarie 2022 13:48:00
Problema Algoritmul Bellman-Ford Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>

using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");

int n, m, v[101][101], d[101];
const int inf=1000000000;

int main()
{
    int i, j, h, x, y, c;
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>x>>y>>c;
        v[x][y]=c;
    }
    d[1]=0;
    for(i=2; i<=n; i++)
        d[i]=inf;
    for(h=1; h<=n-1; h++)
    {
        for(i=1; i<=n; i++)
            for(j=1; j<=n; j++)
                if(d[j]>d[i]+v[i][j])
                    d[j]=d[i]+v[i][j];
    }
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
            if(d[j]>d[i]+v[i][j])
            {
                fout<<"Ciclu negativ!";
                return 0;
            }
    for(i=2; i<=n; i++)
        fout<<d[i]<" ";
    return 0;
}