Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- #include<algorithm>
- using namespace std;
- int main(){
- int n;
- cin >> n;
- int d[n][n];
- for(int i = 0; i < n; ++i){
- for(int j = 0; j < n; ++j){
- cin >> d[i][j];
- }
- }
- for(int k = 0; k < n; ++k){
- for(int i = 0; i < n; ++i){
- for(int j = 0; j < n; ++j){
- d[i][j] = min (d[i][j], d[i][k] + d[k][j]);
- }
- }
- }
- int maxl = 0;
- for(int i = 0; i < n; ++i){
- for(int j = 0; j < n; ++j){
- if(d[i][j] > maxl){
- maxl = d[i][j];
- }
- }
- }
- cout << maxl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement