NOIP2010普及组 三国游戏 -SilverN

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
int d[510][510];
int n;
int fst,snd,ans;
int main(){
scanf("%d",&n);
int i,j,x;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
{
scanf("%d",&d[i][j]);
d[j][i]=d[i][j];
}
for(i=1;i<=n;i++){
fst=0;snd=0;
for(j=1;j<=n;j++){
if(d[i][j]>fst){
snd=fst;
fst=d[i][j];
}
else if(d[i][j]>snd)snd=d[i][j];
if(snd>ans)ans=snd;
}
}
printf("1\n%d",ans);
return 0;
}