Cod sursa(job #1845620)

Utilizator r00t_Roman Remus r00t_ Data 11 ianuarie 2017 18:40:05
Problema Floyd-Warshall/Roy-Floyd Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
//roy-floyd

#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");

int dist[1000][1000];

void roy_warshall(int n){

    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(i!=j && dist[i][k] && dist[k][j] && ( dist[i][j]>dist[i][k]+dist[k][j]||!dist[i][j]))
                    dist[i][j]=dist[i][k]+dist[k][j];
            }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            fout<<dist[i][j]<<' ';
        }
        fout<<'\n';
    }
}

int main()
{
    int n;
    fin>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)
            fin>>dist[i][j];
    }
    roy_warshall(n);

    return 0;
}