摘要： problem linkhttp://codeforces.com/contest/117/problem/DThe transformation is a recursive process.For example:L0: (1 2 3 4 5 6 7 8 9 10) D = 1 <==> 2^0L1: (1 3 5 7 9) (2 4 6 8 10) D = 2 <==> 2^1　L2: (1 5 9) (3 7) (2 6 10) (4 8) D = 4 <==> 2^2L3: (1 9) (5)... 阅读全文