Submission

Score: 100

User: agnes_chan

Problemset: สร้างคู่ผกผัน (Inversion)

Language: cpp

Time: 0.002 second

Submitted On: 2026-05-08 17:25:34

#include <bits/stdc++.h>
using namespace std;
std::vector<int> inversion(int N,int S){
    if(!N) return {};
    vector<int> inv;
    for(int i=0;i++<N;inv.emplace_back(i));
    for(int i=N,j;i;i--)
        for(j=N-i;j;j--){
            if(!S) return inv;
            if(inv[j-1]<inv[j]){
                swap(inv[j-1],inv[j]);
                S--;
            }
        }
    return inv;
}