CF GYM 100548 The Problem Needs 3D Arrays（2014ACM西安现场赛Problem C）

最新推荐文章于 2019-09-22 00:05:26 发布

wujy47

最新推荐文章于 2019-09-22 00:05:26 发布

阅读量2.9k

点赞数

分类专栏：网络流-最小割 ACM 文章标签： ACM2014 acm-icpc 西安2014

本文链接：https://blog.csdn.net/wujysh/article/details/43085275

版权

ProblemC. The Problem Needs 3D Arrays

Description

A permutation is asequence of integers p₁, p₂, . . . , p_n,consisting of n distinct positive integers and each of them does notexceed n. Assume that r(S) of sequence S denotes the number ofinversions in sequence S (if i < j and S_i > S_j,then the pair of (i, j) is called an inversion of S), l(S) ofsequence S denotes the length of sequence S. Given a permutation P oflength n, it’s your task to find a subsequence S of P with maximumr(S) / l(S). A subsequence of P is a sequence (p_i1, p_i2,. . . , p_it) which satisfies that 0 < i₁ <i₂ < . . . < i_t ≤ n.

Input

The first line ofthe input gives the number of test cases, T. T test cases follow.

For each test case,the first line contains an integer n (1 ≤ n ≤ 100), the length ofthe permutation P. The second line contains n integers p₁,p₂, . . . , p_n, which represents thepermutation P.

Output

For each test case,output one line containing “Case #x: y”, where x is the test casenumber (starting from 1) and y is the maximum r(S) / l(S).

Your answer will beconsidered correct if it is within an absolute error of 10⁻⁶of the correct answer.

Samples

Sample Input

Sample Output

3 4 2 5 1