Car
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1310 Accepted Submission(s): 190
Problem Description
Ruins is driving a car to participating in a programming contest. As on a very tight schedule, he will drive the car without any slow down, so the speed of the car is non-decrease real number.
Of course, his speeding caught the attention of the traffic police. Police record $N$ positions of Ruins without time mark, the only thing they know is every position is recorded at an integer time point and Ruins started at $0$.
Now they want to know the minimum time that Ruins used to pass the last position.
Of course, his speeding caught the attention of the traffic police. Police record $N$ positions of Ruins without time mark, the only thing they know is every position is recorded at an integer time point and Ruins started at $0$.
Now they want to know the minimum time that Ruins used to pass the last position.
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 number of the recorded positions.
The second line contains $N$ numbers $a_1$, $a_2$, $\cdots$, $a_N$, indicating the recorded positions.
Limits
$1 \leq T \leq 100$
$1 \leq N \leq 10^5$
$0 < ai \leq 10^9$
$a_i < a_{i+1}$
Every test case begins with an integers $N$, which is the number of the recorded positions.
The second line contains $N$ numbers $a_1$, $a_2$, $\cdots$, $a_N$, indicating the recorded positions.
Limits
$1 \leq T \leq 100$
$1 \leq N \leq 10^5$
$0 < ai \leq 10^9$
$a_i < a_{i+1}$
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 minimum time.
Sample Input
1 3 6 11 21
Sample Output
Case #1: 4