-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathTemporary Temperature
55 lines (54 loc) Β· 1.08 KB
/
Temporary Temperature
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
#include <bits/stdc++.h>
using namespace std;
bool feasible(int d,const vector<int>& a,int n,int k) {
int ch=0,cl=a[0]-d,chigh=a[0]+d;
int i=0;
while(i<n)
{
int nl=a[i]-d,nh=a[i]+d;
if(nh<cl||nl>chigh){
++ch;
cl=nl;
chigh=nh;
}
else
{
cl=max(cl,nl);
chigh=min(chigh,nh);
}
if(ch>k){
return false;
}
i++;
}
return true;
}
int main() {
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
vector<int> a(n);
for (int i=0;i<n;i++){
cin>>a[i];
}
int l=0, r=*max_element(a.begin(), a.end())-*min_element(a.begin(), a.end());
int res=r;
while(l<=r)
{
int mid=l+(r-l)/2;
bool isFeasible=feasible(mid,a,n,k);
if(isFeasible)
{
res = mid;
r=mid-1;
}
else{
l=mid+1;
}
}
cout<<res<<endl;
}
return 0;
}