提出 #10023083

---

ソースコード 拡げる

import re
from copy import deepcopy
import math
from itertools import combinations


def inputIntList():
  return [int(s) for s in input().split()]


def inputInt():
  return int(input())


inf = float('inf')


def argmax(lst):
  return lst.index(max(lst))


def main():
  N = inputInt()
  a = {}
  for i in range(N-1):
    row = inputIntList()
    for j, v in enumerate(row):
      a[(i, i+j+1)] = v

  ans = -inf
  for i in range(3 ** N):
    group = [[] for _ in range(3)]
    v = 0
    for j in range(N):
      g = i % 3
      i = int(i / 3)
      group[g].append(j)
    for g in group:
      for c in combinations(g, 2):
        v += a[c]
    ans = max(ans, v)
  return ans


if __name__ == "__main__":
  print(main())

提出情報

ジャッジ結果