Submission

Score: 100

User: tull

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-26 00:18:13

#include <vector>
//#include "inversion.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> inversion(int n, int s) {
    vector<int>ans(n);
    iota(ans.begin(),ans.end(),1);
    int cnt=0;
    for(int i=0;i<n;++i){
        if(cnt==s){
            break;
        }
        for(int j=n-1;j>i;--j){
            swap(ans[j],ans[j-1]);
            if(++cnt==s){
                break;
            }
        }
        if(cnt==s)break;
    }
    return ans;
}