Cod sursa(job #1631768)

Utilizator hackerliAndrei Ion hackerli Data 5 martie 2016 18:45:54
Problema Algoritmul Bellman-Ford Scor 35
Compilator cpp Status done
Runda Arhiva educationala Marime 1.35 kb
#include <fstream>
#include <iostream>
#define inf 99999999
using namespace std;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");
int n, m, x, y, dist, d[32000], t[32000];
int a[23000][23000];
int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            a[i][j]=inf;
        }
        t[i]=inf;
        d[i]=inf;
    }
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>dist;
        a[x][y]=dist;
        if(x==1)
        {
            d[y]=dist;
            t[y]=1;
        }
    }
    int ok=1, k=1;
    while(ok&&k<=n+1)
    {
        ok=0;
        for(int i=2; i<=n; i++)
        {
            if(d[i]!=inf)
            {
                for(int j=2; j<=n; j++)
                {
                    if(a[i][j]!=inf&&i!=j&&d[j]>d[i]+a[i][j])
                    {
                        t[j]=i;
                        d[j]=d[i]+a[i][j];
                        ok=1;
                    }
                }
            }
        }
        k++;
    }
    if(k>n)
    {
        fout<<"Ciclu negativ!";
    }
    else
    {
        for(int i=2; i<=n; i++)
        {
            fout<<d[i]<<' ';
        }
    }
    fin.close();
    fout.close();
    return 0;
}
/*
6 8
1 6 8
6 5 1
5 4 -1
4 3 -2
3 2 1
2 4 2
5 2 -4
1 2 10
*/