Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <cmath>
- #include <algorithm>
- #include <string>
- #include <map>
- #include <set>
- #define ll long long
- #define endl "\n"
- using namespace std;
- int main()
- {
- int n;
- cin >> n;
- vector<vector<pair<int, ll>>> g(n);
- for (int i = 0; i < n; ++i)
- {
- for (int j = 0; j < n; ++j)
- {
- ll a;
- cin >> a;
- if (a != -1)
- {
- g[i].push_back({ j, a });
- }
- }
- }
- vector<vector<ll>> dp(n, vector<ll>(n, 2e18));
- for (int i = 0; i < n; ++i)
- {
- for (auto u : g[i])
- {
- dp[i][u.first] = min(dp[i][u.first], u.second);
- }
- }
- for (int k = 1; k < n; ++k)
- {
- for (int i = 0; i < n; ++i)
- {
- for (int j = 0; j < n; ++j)
- {
- dp[i][j] = min(dp[i][j], dp[i][k] + dp[k][j]);
- }
- }
- }
- ll ans = -2e18;
- for (int i = 0; i < n; ++i)
- {
- for (int j = 0; j < n; ++j)
- {
- if (dp[i][j] != 2e18)
- {
- ans = max(ans, dp[i][j]);
- }
- }
- }
- cout << ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement