给出了最短路邻接矩形的下三角形式,让你计算最短路中的最大值
为x时代表i->j ,j -> i 都走不通,否则双向建边
/***********************************************
* Author: fisty
* Created Time: 2015/2/16 19:19:12
* File Name : four_7.cpp
*********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 110
int n;
int G[MAX_N][MAX_N];
int solve(){
for(int k = 1;k <= n; k++){
for(int i = 1;i <= n; i++){
for(int j = 1;j <= n; j++){
if(G[i][j] > G[i][k] + G[k][j]){
G[i][j] = G[i][k] + G[k][j];
}
}
}
}
int ans = -INF;
for(int i = 1;i <= n; i++){
ans = max(G[1][i], ans);
}
return ans;
}
int main() {
//freopen("in.cpp", "r", stdin);
//cin.tie(0);
//ios::sync_with_stdio(false);
Memset(G, 0x3f);
cin >> n;
for(int i = 2;i <= n; i++){
for(int j = 1; j < i; j++){
char x[10];
scanf("%s", x);
if(x[0] == 'x'){
G[i][j] = G[j][i] = INF;
}else{
G[i][j] = G[j][i] = atoi(x);
}
}
}
int ans = solve();
cout << ans << endl;
return 0;
}