-
Notifications
You must be signed in to change notification settings - Fork 0
/
12032.cpp
57 lines (49 loc) · 1.09 KB
/
12032.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/*
**************************************************************
* Author : Bemen Girgis
* Contact : [email protected]
* Problem : 12032 UVA
* Link : https://onlinejudge.org/external/120/p12032.pdf
**************************************************************
* Approach:
**************************************************************
*/
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int height[100005];
int n;
bool viable(int k) {
for (int i = 1; i <= n; ++i) {
const int diff = height[i] - height[i - 1];
if (diff == k) {
--k;
} else if (diff > k) {
return false;
}
}
return true;
}
int main() {
int tc; scanf("%d", &tc);
for (int caseNo = 1; caseNo <= tc; ++caseNo) {
scanf("%d", &n);
int j = 0;
for (int i = 1; i <= n; ++i) { // loop starts from 1 reserving height[0] = 0
scanf("%d", height + i);
j = max(j, height[i] + 1);
}
int i = 0; int ans = 1e9;
while (i < j) {
int mid = (i + j) / 2;
if (viable(mid)) {
j = mid;
ans = mid;
} else {
i = mid + 1;
}
}
printf("Case %d: %d\n", caseNo, ans);
}
return 0;
}