Open degageyisui opened 5 years ago
https://www.degage.xyz/2018/10/16/6/
Description给一个1~n的排列p[i]，Jeff先手可以交换任意两个相邻元素，而Furik会有0.5的几率把任意满足p[i] < p[i+1]的p[i]和p[i+1]交换，有0.5的几率把任意满足p[i] > p[i+1]的p[i]和p[i+1]交换，问将整个序列变成升序所需的最小期望步数
https://www.degage.xyz/2018/10/16/6/
Description给一个1~n的排列p[i]，Jeff先手可以交换任意两个相邻元素，而Furik会有0.5的几率把任意满足p[i] < p[i+1]的p[i]和p[i+1]交换，有0.5的几率把任意满足p[i] > p[i+1]的p[i]和p[i+1]交换，问将整个序列变成升序所需的最小期望步数