Codeforces Round #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.html Your task is to replace the minimum number of eleme

>>阅读原文<<