2018 Petrozavodsk Winter Camp, Yandex Cup
题目链接:gym102155F Shuffle
题目大意:
设字符串 s = s 1 s 2 ⋯ s n s=s_1s_2\cdots s_n s=s1s2⋯sn( n n n 为偶数),定义操作:
shuffle ( s ) = s 1 s 3 ⋯ n − 1 s 2 s 4 ⋯ s n \text{shuffle}(s)=s_1s_3\cdots_{n-1}s_2s_4\cdots s_n shuffle(s)=s1s3⋯n−1s2s4⋯sn
给字符串 s s s 和 t t t ,问最少经过多少次 shuffle \text{shuffle} shuffle 后 s s s 变成了 t t t。
解题思路:
设:
s = a a b b c c d b a e