题解 | 构造数列

#include <bits/stdc++.h>
using namespace std;
const int N=3e5+10;
const int mod = 998244353;
typedef long long ll;
typedef unsigned long long ull;
int n;


void solve()
{
    cin>>n;
    int sum=0;
    int x = 2;
    vector<int>ans;
    for(int i=1;i<=n/2;i++)
    {
        ans.push_back(x);
        sum+=x;
        x+=2;
    }
    int y = 1;
    for(int i=1;i<n/2;i++)
    {
        ans.push_back(y);
        sum-=y;
        y+=2;
    }
    int rest = sum;
    if(rest%2==1)
    {
        cout<<"YES"<<'\n';
        ans.push_back(rest);
        for(auto x:ans)cout<<x<<' ';
        cout<<'\n';

    }
    else cout<<"NO\n";

}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
    {
        solve();

    }


    return 0;
}

依旧是很好想的一个构造题