#636 (Div. 3)D.Constant Palindrome Sum(差分)

題目描述 You are given an array a consisting of n integers (it is guaranteed that n is even, i.e. divisible by 2). All ai does not exceed some integer k. Your task is to replace the minimum number of elem

>>阅读原文<<