Cod sursa(job #3039136)

Utilizator Bogdan405Mocrei Bogdan Bogdan405 Data 28 martie 2023 10:56:41
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>

using namespace std;

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

int n,m,x[250003],y[250003],c[250003],t[50003],dist[50003];
const int inf=2e9;

int main()
{
    int i,j,x1,x2,cost;
    f >> n >> m;
    for (i=1;i<=m;i++)
        f >> x[i] >> y[i] >> c[i];
    for (i=1;i<=n;i++)
    {
        dist[i]=inf;
        t[i]=0;
    }
    dist[1]=0;
    for (i=1;i<n;i++)
        for (j=1;j<=m;j++)
            if (dist[y[j]]>dist[x[j]]+c[j])
            {
                dist[y[j]]=dist[x[j]]+c[j];
                t[y[j]]=x[j];
            }
    for (i=1;i<=m;i++)
        if (dist[y[i]]>dist[x[i]]+c[i])
        {
            g << "Ciclu negativ!";
            return 0;
        }
    for (i=2;i<=n;i++)
        g << dist[i] << ' ';
    return 0;
}