题解 | 构造数列

#include<bits/stdc++.h>

using namespace std;

const int N=2e5+5;

int T;
int n,a[N];

int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        if((n/2)%2==1)
        {
            puts("NO");
            continue;
        }
        else puts("YES");
        for(int i=1;i<=n/2;i+=2)
        {
            int tmp=i/2;
            a[i]=tmp*6+2;
            a[i+1]=tmp*6+4;
        }
        for(int i=n/2+1;i<=n;i+=2)
        {
            int tmp=(i-n/2)/2;
            a[i]=tmp*6+1;
            a[i+1]=tmp*6+5;
        }
        for(int i=1;i<=n;i++) printf("%d ",a[i]);
        puts("");
    }
    return 0;
}