Cod sursa(job #3138013)

Utilizator tudor_costinCostin Tudor tudor_costin Data 17 iunie 2023 00:31:04
Problema Floyd-Warshall/Roy-Floyd Scor 40
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
const int Nmax=105;
int m[Nmax][Nmax],dp[Nmax][Nmax][Nmax];
int main()
{
    int n;
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fin>>m[i][j];
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            dp[i][j][1]=min(m[i][j],m[i][1]+m[1][j]);
        }
    }
    for(int k=2;k<=n;k++)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                dp[i][j][k]=min(dp[i][j][k-1],dp[i][k][k-1]+dp[k][j][k-1]);
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fout<<dp[i][j][n]<<' ';
        }
        fout<<'\n';
    }
    return 0;
}