Submission #36268124

---

Source Code Expand

def solve():
    N=int(input())
    P=list(map(int,input().split()))

    def inversion(P):
        return [N+1-p for p in P]

    def next(P):
        S=[]
        for i in range(N-1,0,-1):
            S.append(P[i])
            if P[i-1]<P[i]:
                S.append(P[i-1])
                a=P[i-1]
                break

        P=P[:i-1]
        S.sort()
        for j,b in enumerate(S):
            if a<b:
                P.append(b)
                del S[j]
                break
        return P+S

    return inversion(next(inversion(P)))

#==================================================
print(*solve())

Submission Info

Judge Result