Codeforces Round #636 (Div. 3) B. Balanced Array

Problem Description

You are given a positive integer n, it is guaranteed that n is even (i.e. divisible by 2).
You want to construct the array a of length n
such that:
The first n2
elements of a are even (divisible by 2);
the second n2
elements of a are odd (not divisible by 2);
all elements of a are distinct and positive;
the sum of the first half equals to the sum of the second half (∑i=1n2ai=∑i=n2+1nai).
If there are multiple answers, you can print any. It is not guaranteed that the answer exists.
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 only line of the test case contains one integer n
(2≤n≤2⋅105) — the length of the array. It is guaranteed that that n is even (i.e. divisible by 2).
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 (∑n≤2⋅105).

output

For each test case, print the answer — “NO” (without quotes), if there is no suitable answer for the given test case or “YES” in the first line and any suitable array a1,a2,…,an (1≤ai≤109) satisfying conditions from the problem statement on the second line.

Example

intput
5
2
4
6
8
10
output
NO
YES
2 4 1 5
NO
YES
2 4 6 8 1 3 5 11
NO

题意：有一个长度为偶数的数列，前半部分全是偶数，后半部分全是奇数
求有没有这样的数列能使数列的前半部分和等于后半部分和。只要找规律即可，蛮简单的一个题。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <string>
#define maxn 101
#define MAXN 100001
#define mod 100000000
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
int main()
{
    int t;
    int n,i;
    cin>>t;
    while(t--)
    {
        cin>>n;
        if(((n/2-1)+n)%2==0)
            cout<<"NO"<<endl;
        else
        {
            cout<<"YES"<<endl;
            for(i=1;i<=n/2;i++)
                cout<<2*i<<' ';
            for(i=1;i<=n/2-1;i++)
                cout<<2*i-1<<' ';
            cout<<(n/2-1)+n<<endl;
        }
    }
    return 0;
}