Mai intai trebuie sa te autentifici.
Cod sursa(job #1436594)
Utilizator | Data | 16 mai 2015 09:58:49 | |
---|---|---|---|
Problema | Floyd-Warshall/Roy-Floyd | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.99 kb |
#include <fstream>
#include <climits>
#define DIM 102
#define INF LONG_MAX
using namespace std;
ifstream fin("royfloyd.in");
ofstream fout("royfloyd.out");
int N,C[DIM][DIM],D[DIM][DIM];
int Drum[DIM];
int main(){
fin>>N;
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++){
fin>>C[i][j];
if(i!=j){
if(C[i][j]==0)
C[i][j]=INF;
else
D[i][j]=i;
}
}
for(int k=1;k<=N;k++)
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(i!=j && i!=k && j!=k && C[i][j]>C[i][k]+C[k][j]){
C[i][j]=C[i][k]+C[k][j];
D[i][j]=D[k][j];
}
for(int i=1;i<=N;i++){
for(int j=1;j<=N;j++)
if(C[i][j]!=INF)
fout<<C[i][j]<<" ";
else
fout<<"0 ";
fout<<"\n";
}
fin.close();fout.close();
return 0;
}