#640(Div.4)G. Special Permutation（找規律+構造）

題目描述 A permutation of length n is an array p=[p1,p2,…,pn], which contains every integer from 1 to n (inclusive) and, moreover, each number appears exactly once. For example, p=[3,1,4,2,5] is a permuta

>>阅读原文<<