Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream fin("intrare.in");
- ofstream fout("graf.out");
- const int inf=999;
- int n,m,A[101][101],dmax=0;
- void roy()
- {
- for(int k=1;k<=n;k++)
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(A[i][j]>A[i][k]+A[k][j])
- A[i][j]=A[i][k]+A[k][j];
- }
- int main()
- {
- fin>>n>>m;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(i!=j) A[i][j]=inf;
- for(int i=1;i<=m;i++)
- {
- int x,y,c;
- fin>>x>>y>>c;
- A[x][y]=c;
- }
- roy();
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(A[i][j]>dmax) dmax=A[i][j];
- fout<<dmax<<endl;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(A[i][j]==dmax)
- fout<<i<<" "<<j<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement