（博弈/基础）三国游戏

https://www.luogu.org/problemnew/show/P1199

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 500 + 5;
int d[maxn][maxn];
int main()
{
    int n, tot = 0;
    scanf("%d", &n);
    for (register int i = 1; i < n; i++) {
        for (register int j = i + 1; j <= n; j++) {
            scanf("%d", &d[i][j]);
            d[j][i] = d[i][j];
        }
    }
    int ans = 0;
    for (register int i = 1; i <= n; i++) {
        sort(d[i] + 1, d[i] + n + 1);
        ans = max(ans, d[i][n - 1]);
    }
    printf("1\n%d\n", ans);
    // system("pause");
}

分析->暴力