提示: 欢迎访问OurACM平台。
Problem 1939 Sequence Adjustment

Accept: 16    Submit: 53
Time Limit: 1000 mSec    Memory Limit : 32768 KB

Problem Description

Given a sequence consists of N integers. Each time you can choose a continuous subsequence and add 1 or minus 1 to the numbers in the subsequence .You task is to make all the numbers the same with the least tries. You should calculate the number of the least tries you needed and the number of different final sequences with the least tries.

Input

In the first line there is an integer T, indicates the number of test cases.(T<=30)

In each case, the first line contain one integer N(1<=N<=10^6), the second line contain N integers and each integer in the sequence is between [1,10^9].

There may be some blank lines between each case.

Output

For each test case , output “Case d: x y “ where d is the case number counted from one, x is the number of the least tries you need and y is the number of different final sequences with the least tries.

Sample Input

2 2 2 4 6 1 1 1 2 2 2

Sample Output

Case 1: 2 3 Case 2: 1 2

Hint

In sample 1, we can add 1 twice at index 1 to get {4,4},or minus 1 twice at index 2 to get {2,2}, or we can add 1 once at index 1 and minus 1 once at index 2 to get {3,3}. So there are three different final sequences.

Source

2010 ACM-ICPC Multi-University Training Contest(1)--Host by FZU

Submit  Back  Status  Discuss