Cod sursa(job #521228)

Utilizator andraiandra ionescu andrai Data 11 ianuarie 2011 18:57:52
Problema Floyd-Warshall/Roy-Floyd Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include<fstream>
const int INF=100000000;
using namespace std;
long long n, c[105][105], d[105][105];
void floyd()
{
	 int i,j,k;
	 for(i=1;i<=n;i++)
		 for(j=1;j<=n;j++)
			 {if(c[i][j]!=0&&c[i][j]!=INF)
				 urm[i][j]=j;
			         else urm[i][j]=0;}
	 memcpy(d,c,sizeof(c));
     for(k=1;k<=n;k++)
         for(i=1;i<=n;i++)
             for(j=1;j<=n;j++)
                 if(d[i][j]>d[i][k]+d[k][j])
				 {
					  d[i][j]=d[i][k]+d[k][j];
					  urm[i][j]=urm[i][k]+urm[k][j];
				 }					 
}
int main()
{
	 int i,j;
	 ifstream f("royfloyd.in");
	 ofstream g("royfloyd.out");
     f>>n;
  	 for(i=1;i<=n;i++) 
		 for(j=1;j<=n;j++) {f>>c[i][j];if(i!=j&&c[i][j]==0) c[i][j]=INF;}
	 floyd();
	 for(i=1;i<=n;i++)
	 {
		 for(j=1;j<=n;j++) 
			 if(d[i][j]==INF) g<<0<<" ";else g<<d[i][j]<<" ";
		 g<<endl;
	 }
	 return 0;
}