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 elements (replacement is the following operation: choose some index i from 1 to n and replace ai with some integer in range [1;k]) to satisfy the following conditions:

after all replacements, all ai are positive integers not greater than k;
for all i from 1 to n2 the following equation is true: ai+an−i+1=x, where x should be the same for all n2 pairs of elements.
You have to answer t independent test cases.

Input
The first line of the input contains one integer t (1≤t≤104) — the number of test cases. Then t test cases follow.

The first line of the test case contains two integers n and k (2≤n≤2⋅105,1≤k≤2⋅105) — the length of a and the maximum possible value of some ai correspondingly. It is guratanteed that n is even (i.e. divisible by 2). The second line of the test case contains n integers a1,a2,…,an (1≤ai≤k), where ai is the i-th element of a.

It is guaranteed that the sum of n (as well as the sum of k) over all test cases does not exceed 2⋅105 (∑n≤2⋅105, ∑k≤2⋅105).

Output
For each test case, print the answer — the minimum number of elements you have to replace in a to satisfy the conditions from the problem statement.
题解：

#include<bits/stdc++.h>
using namespace std;
int c[5000005], b[5000005], a[5000005];
int main()
{
	int t;
	cin >> t;
	while(t--)
	{
		int n, k;
		scanf("%d%d", &n, &k);
		for(int i = 1; i <= n; i++)
			scanf("%d", a + i);
		fill(c, c + 2 * k + 5, 0);
		fill(b, b + 2 * k + 5, 0);
		for(int i = 1; i <= n / 2; i++)
			c[a[i] + a[n - i + 1]]++;
		for(int i = 1; i <= n / 2; i++)
		{
			b[min(a[i], a[n - i + 1]) + 1]++;
			b[max(a[i], a[n - i + 1]) + k + 1]--;
		}
		for(int i = 3; i <= 2 * k; i++)
			b[i] += b[i - 1];
		int ans = 5000005;
		for(int x = 2; x <= 2 * k; x++)
			ans = min(ans, b[x] - c[x] + (n / 2 - b[x]) * 2);
		printf("%d\n", ans);
	}
	return 0;
}