Moscow Pre-Finals Workshop 2016. National Taiwan U Selection

Problem A

Solved by ultmaster. 00:58 (+)

Problem B

Solved by zerol. 03:46 (+)

Problem F

Solved by zerol. 00:34 (+)

Problem H

Unsolved. (-10)

Problem I

Solved by zerol. 02:07 (+)

Problem J

Solved by kblack. 01:33 (+5)

题意：$C_k = MAX_{i+j \equiv k \pmod{n}}{a_i+b_j}$

题解：两边各找最大的 3000，互相搞一搞，好了？