题解 | 小红的排列构造②

import sys

def find():
    n = int(input())
    sstr = input()
    if sstr[-1]=='0':
        return [-1]
    f = [i + 1 for i in range(n)]
    for i in range(n - 1, -1, -1):
        if sstr[i] == "0":
            f[i], f[i + 1] = f[i + 1], f[i]
    return f


for i in find():
    print(i, end=" ")