编程介的小学生 2020-01-17 21:37 采纳率: 20.5%
浏览 186

Harmony 的问题

Problem Description
Ali is given an array, which is a permutation of {1, 2, 3 ... , n}. He thinks that only the increasing sequence is harmony, so he wants to change the sequence into a harmony one. But the only operation he can use is: Choosing a contiguous subsequence {A[i], A[i + 1]...A[j]} and do a random shuffling on it. (Random shuffle means that every permutation will appear with equal possibility)
So, what’s the expected number of operations when using the best strategy?

Input
The input consists several testcases.
First line, an integer N (0 < N <= 50) denoting the length of this array.
In the next line there are N integers, representing a permutation.

Output
Print one line with the expectation.
The result should be given with absolute or relative error of at most 10-6.

Sample Input
5
2 1 3 5 4

Sample Output
4.0000000000

  • 写回答

0条回答 默认 最新

    报告相同问题?

    悬赏问题

    • ¥15 求差集那个函数有问题,有无佬可以解决
    • ¥15 【提问】基于Invest的水源涵养
    • ¥20 微信网友居然可以通过vx号找到我绑的手机号
    • ¥15 寻一个支付宝扫码远程授权登录的软件助手app
    • ¥15 解riccati方程组
    • ¥15 display:none;样式在嵌套结构中的已设置了display样式的元素上不起作用?
    • ¥15 使用rabbitMQ 消息队列作为url源进行多线程爬取时,总有几个url没有处理的问题。
    • ¥15 Ubuntu在安装序列比对软件STAR时出现报错如何解决
    • ¥50 树莓派安卓APK系统签名
    • ¥65 汇编语言除法溢出问题