# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316637 | Dymo | Watching (JOI13_watching) | C++14 | 268 ms | 38272 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define pll pair<ll,ll>
#define ff first
#define ss second
#define endl "\n"
const ll maxn=5e3+50;
const ll mod =1e9+7;
const ll base=317;
ll p, q, n ;
ll a[maxn];
ll dp[maxn][maxn];
bool chk(ll len)
{
// memset(dp,0 ,sizeof (dp));
ll l=1, r=1;
for (int i=1;i<=n;i++)
{
while (a[l]<a[i]-len+1) l++;
while (a[r]<a[i]-2*len+1) r++;
for (int j=0;j<=p;j++)
{
dp[i][j]=1e15;
if (j)dp[i][j]=dp[l-1][j-1];
dp[i][j]=min(dp[r-1][j]+1,dp[i][j]);
}
}
if (dp[n][p]<=q) return true;
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
if (fopen("test.t", "r"))
{
freopen("test.inp", "r", stdin);
freopen("test.out", "w", stdout) ;
}
cin>>n>> p>> q;
for (int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1);
if (p+q>=n)
{
cout << 1;
return 0;
}
ll l=1, h= 1e10;
while (l<=h)
{
ll mid=(l+h)/2;
if (chk(mid)) h=mid-1;
else l=mid+1;
}
cout <<l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |