【NOIP2010】【Luogu1199】三国游戏

problem

solution

codes

//mdzz计算机根本不可能会赢???
#include
#define maxn 510
using namespace std;
int a[maxn][maxn], ans;
int main(){
    int n;  cin>>n;
    for(int i = 1; i < n; i++)
        for(int j = i+1; j <= n; j++)
            { cin>>a[i][j]; a[j][i]=a[i][j]; }
    for(int i = 1; i <= n; i++){
        int k=0, l=0;
        for(int j = 1; j <= n; j++){
            if(a[i][j]>k) l = k, k = a[i][j];
            else if(a[i][j] > l) l = a[i][j];
        }
        ans = max(ans, l);
    }
    cout<<"1\n"<"\n";
    return 0;
}

你可能感兴趣的:(算法)