摘要： words... 嗚嗚嗚，怎么大家都會 覺得題解還行就點個贊吧 題面 對于一個排列\(P\)，定義\(f(P)\)如下： def f(P:permutation) -> int: ans = 0 st: Stack[int] = Stack() for i in P: while st is not 閱讀全文