Cod sursa(job #986376)

Utilizator Dddarius95Darius-Florentin Neatu Dddarius95 Data 18 august 2013 16:32:43
Problema Floyd-Warshall/Roy-Floyd Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.12 kb
#include <fstream>
#define Nmax 110
using namespace std;
ifstream f("royfloyd.in");
ofstream g("royfloyd.out");

int n,d[Nmax][Nmax],T[Nmax][Nmax],drum[Nmax],L;

void ReadInput()
{
    f>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            f>>d[i][j];
            if(d[i][j])T[i][j]=i;
        }
}

void RoyFloyd(int d[Nmax][Nmax])
{
    for(int k=1;k<=n;k++)
     for(int i=1;i<=n;i++)
      for(int j=1;j<=n;j++)
        if(i!=j && d[i][k] && d[k][j] && (!d[i][j] || d[i][k]+d[k][j]<d[i][j]))
            {
                d[i][j]=d[i][k]+d[k][j];
                T[i][j]=T[k][j];
            }
}

void ShowWay(int start,int finish)
{
    drum[++L]=finish;
    while(drum[L]!=start)
    {
        drum[++L]=T[finish][start];
        finish=T[finish][start];
    }
    for(int i=L;i>0;i++)g<<drum[i]<<" ";
    g<<'\n';
}
void PrintOutput()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)g<<d[i][j]<<' ';
        g<<'\n';
    }
}

int main()
{
    ReadInput();
    RoyFloyd(d);
    PrintOutput();
    f.close();g.close();
    return 0;
}