NOIP2010 Universal Group Three games-silvern

1#include <iostream>2#include <cstdio>3#include <algorithm>4#include <cmath>5 using namespacestd;6 intd[510][510];7 intN;8 intFst,snd,ans;9 intMain () {Tenscanf"%d",&n); One     inti,j,x; A      for(i=1; i<n;i++) -        for(j=i+1; j<=n;j++) -       { thescanf"%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) { ASnd=FST; atfst=D[i][j]; -           } -         Else if(D[I][J]&GT;SND) snd=D[i][j]; -         if(Snd>ans) ans=snd; -       } -     } inprintf"1\n%d", ans); -     return 0; to}

The contents of the topic are not released

Because the computer will always remove the largest combination, so the player can only get the second largest combination of values

Then find the second largest combination.

NOIP2010 Universal Group Three games-silvern