Advertisement
Guest User

Untitled

a guest
Feb 29th, 2020
134
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.65 KB | None | 0 0
  1. #include<iostream>
  2. #include<vector>
  3. #include<algorithm>
  4. using namespace std;
  5.  
  6.  
  7. int main(){
  8. int n;
  9. cin >> n;
  10. int d[n][n];
  11. for(int i = 0; i < n; ++i){
  12. for(int j = 0; j < n; ++j){
  13. cin >> d[i][j];
  14. }
  15. }
  16. for(int k = 0; k < n; ++k){
  17. for(int i = 0; i < n; ++i){
  18. for(int j = 0; j < n; ++j){
  19. d[i][j] = min (d[i][j], d[i][k] + d[k][j]);
  20. }
  21. }
  22. }
  23. int maxl = 0;
  24. for(int i = 0; i < n; ++i){
  25. for(int j = 0; j < n; ++j){
  26. if(d[i][j] > maxl){
  27. maxl = d[i][j];
  28. }
  29. }
  30. }
  31. cout << maxl;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement