Build the Permutation（贪心）

Problem - 1608B - Codeforces

Build Permutation - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)

#include <bits/stdc++.h>
#include <iostream>
#include<unordered_map>
#define x first
#define y second

#define  ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);

using namespace std;

typedef  long  long LL ;
typedef  unsigned long  long ULL ;
typedef pair<int,int> PII ;
typedef pair<LL,int> PLI ;
const int N = 110,M = 1000 * 100000 + 10 ,mod = 1000000007,INF1 = 0x3f3f3f3f;
const LL INF2 = 1e17;



int n,a,b;

inline void solve()
{
    cin>>n>>a>>b;
    //两种情况 最多相差1 个，两个情况的峰组合 一定需要 a+b+2个数 数的个数不能不够
    if(abs(a-b) > 1 || a+b>n-2)
    {
        cout<<-1<<endl;
        return;
    }

    int l=1,r=n,t=(a>b);
    // t=1 ^ ,t=0 v
    for(int i=1;i<=n;i ++ )
    {
        if(t) cout<<l++<<" ";
        else cout<<r--<<" ";
        if(i <= a + b ) t ^=1 ;
    }
    cout<<endl;
}


signed main()
{
    ios
    int T;cin>>T;
    while(T -- )
    {
        solve();

    }


    return 0;
}