#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 2100;
int n, p, q;
set<int>st;
vector<int>v;
int dp[maxn][maxn];
bool check(ll x) {
for(int i=0;i<=v.size();i++) {
for(int j=0;j<=v.size();j++) {
dp[i][j] = 10000000;
}
}
dp[0][0] = 0;
int result = INT_MAX;
int lst = 1, lst2=1;
for(int i=1;i<=v.size();i++) {
//cout<<i<<":\n";
while(v[i-1] - v[lst-1] >= x) lst++;
while(v[i-1] - v[lst2-1] >= 2*x) lst2++;
for(int j=0;j<=q;j++) {
if(v[i-1] - v[lst-1] < x) {
dp[i][j] = min(dp[i][j], dp[lst-1][j]+1);
if(j-1>=0) {
dp[i][j] = min(dp[i][j], dp[lst-1][j-1]);
}
}
if(v[i-1] - v[lst2-1] < 2*x && j>=1) {
dp[i][j] = min(dp[i][j], dp[lst2-1][j-1]);
}
//cout<<j<<": "<<dp[i][j]<<"\n";
if(i == v.size()) {
result = min(result, dp[i][j]);
}
}
}
return result <= p;
}
int main() {
cin>>n>>p>>q;
int x;
for(int i=1;i<=n;i++) {
cin>>x;
st.insert(x);
}
for(int i:st) {
v.pb(i);
}
q = min(q, int(v.size()));
ll l = 0LL, r = 1LL * 1e9;
ll result = LLONG_MAX;
while(l < r) {
ll mid = (l + r) / 2;
if(check(mid)) {
result = min(result, mid);
r = mid;
}
else {
l = mid + 1;
}
}
cout<<result<<"\n";
return 0;
}
Compilation message
watching.cpp: In function 'bool check(long long int)':
watching.cpp:13:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<=v.size();i++) {
~^~~~~~~~~~
watching.cpp:14:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0;j<=v.size();j++) {
~^~~~~~~~~~
watching.cpp:23:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=1;i<=v.size();i++) {
~^~~~~~~~~~
watching.cpp:43:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if(i == v.size()) {
~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
768 KB |
Output is correct |
2 |
Runtime error |
3 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
101 ms |
17152 KB |
Output is correct |
2 |
Runtime error |
4 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
3 |
Halted |
0 ms |
0 KB |
- |