题解 | 小红的排列构造②

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    if(s.back() == '0')
    {
        cout << -1;
        return 0;
    }
    vector<int> id;

    for(int i = 0; i < s.size(); i ++)
        if(s[i] == '1')
            id.push_back(i);

    int cur = 0;
    int mx = 0;
    for(auto i : id)
    {
        cur = i + 1;
        for(int j = cur; j > mx ; j --)
        {
            cout << j << " ";
        }
        mx = cur;
    }
}
// 64 位输出请用 printf("%lld")