题解 | 构造数列

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll t;
void solve()
{
    ll n;
    while(t--){
        cin>>n;
        int m = n/2;
        if(m&1){
            cout<<"NO"<<endl;
            continue;
        }
        else {
            cout<<"YES"<<endl;
            for(int i = 1;i<=m;i++)cout<<2*i<<" ";
            for(int i = 1;i<m;i++)cout<<i*2-1<<" ";
            cout<<m*3-1<<endl;
        }
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>t;
    solve();
    return 0;
}