連鎖行列積 AOJ import sys input = sys.stdin.buffer.readline N = int(input()) *A, = map(int, sys.stdin.buffer.read().split()) A = [A[0]] + A[1::2] INF = 1 << 30 dp = [[INF]*N for _ in [0]*N] # [l, r]まで積を取ったときの最小乗算回数 for i in…