当前你的浏览器版本过低，网站已在兼容模式下运行，兼容模式仅提供最小功能支持，网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器：

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

4923：Room and Moor

题目描述
PM Room defines a sequence A = {A1, A2,..., AN}, each of which is either 0 or 1. In order to beat him, programmer Moor has to construct another sequence B = {B1, B2,... , BN} of the same length, which satisfies that:

输入解释
The input consists of multiple test cases. The number of test cases T(T<=100) occurs in the first line of input.

For each test case:
The first line contains a single integer N (1<=N<=100000), which denotes the length of A and B.
The second line consists of N integers, where the ith denotes Ai.
输出解释
Output the minimal f (A, B) when B is optimal and round it to 6 decimals.
输入样例 
4
9
1 1 1 1 1 0 0 1 1
9
1 1 0 0 1 1 1 1 1
4
0 0 1 1
4
0 1 1 1
输出样例 
1.428571
1.000000
0.000000
0.000000
来自杭电HDUOJ的附加信息
Author BUPT
Recommend
该题目是Virtual Judge题目，来自 杭电HDUOJ
题目来源 2014 Multi-University Training Contest 6
源链接： HDU-4923
最后修改于 2020-10-25T23:18:06+00:00 由爬虫自动更新
共提交 0 次
通过率 --%
时间上限 内存上限
12000/6000MS(Java/Others) 262144/262144K(Java/Others)