编程介的小学生 2017-06-06 08:11 采纳率: 20.5%
浏览 800
已采纳

Inequality

Problem Description
Little Ruins is a studious boy, recently he learned inequation!

As homework, his teacher gives him a problem of inequation: give you an array a with length N−1, please find an array x with length N and xi×xi+1≥ai for each i from 1 to N−1 and try to minimize the sum of x.

Input
First line contains an integer T, which indicates the number of test cases.

Every test case begins with an integers N, which is the length of array x.

The second line contains N−1 integers a1, a2, ⋯, aN−1, indicating the array a.

Limits
1≤T≤50.
1≤N≤2000.
0<ai≤104.
For 80\% of the use cases, 1≤N≤100 holds.

Output
For every test case, you should output 'Case #x: y', where x indicates the case number and counts from 1 and y is the result.

Round the y to the fifth digit after the decimal point.

Sample Input
2
4
2 3 2
4
1 2 3

Sample Output
Case #1: 5.77350
Case #2: 5.47723

  • 写回答

1条回答 默认 最新

  • devmiao 2017-06-24 17:02
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥100 关于使用MATLAB中copularnd函数的问题
  • ¥20 在虚拟机的pycharm上
  • ¥15 jupyterthemes 设置完毕后没有效果
  • ¥15 matlab图像高斯低通滤波
  • ¥15 针对曲面部件的制孔路径规划,大家有什么思路吗
  • ¥15 钢筋实图交点识别,机器视觉代码
  • ¥15 如何在Linux系统中,但是在window系统上idea里面可以正常运行?(相关搜索:jar包)
  • ¥50 400g qsfp 光模块iphy方案
  • ¥15 两块ADC0804用proteus仿真时,出现异常
  • ¥15 关于风控系统,如何去选择