# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487666 | stefantaga | Stove (JOI18_stove) | C++14 | 1077 ms | 3588 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;
long long din[2][100005];
long long mini,v[100005];
int n,k,i,j;
void divide(int st,int dr,int mxst,int mxdr,int acum,int inainte)
{
if (st>dr)
{
return;
}
int mij=(st+dr)/2,poz;
long long mini=1e12,lim=min(mxdr,mij);
din[acum][mij]=1e12;
for (int i=mxst;i<=lim;i++)
{
if (v[mij]-v[i]+1+din[inainte][i-1]<din[acum][mij])
{
din[acum][mij]=v[mij]-v[i]+1+din[inainte][i-1];
poz=i;
}
}
divide(st,mij-1,mxst,poz,acum,inainte);
divide(mij+1,dr,poz,mxdr,acum,inainte);
}
int main()
{
#ifdef HOME
ifstream cin("date.in");
ofstream cout("date.out");
#endif // HOME
cin>>n>>k;
for (i=1;i<=n;i++)
{
cin>>v[i];
din[1][i]=v[i]-v[1]+1;
}
for (i=2;i<=k;i++)
{
int acum,inainte;
acum=i%2;
inainte=1-acum;
divide(1,n,1,n,acum,inainte);
}
cout<<din[k%2][n];
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |