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 <iostream>
#include <fstream>
#include <climits>
using namespace std;
const int nmax=100005;
long long v[nmax],dp[2][nmax],mn[nmax];
int st[nmax];
int n,k,i,j,use,u;
int main()
{
// freopen("data.in","r",stdin);
ios_base::sync_with_stdio(false);
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>v[i];
}
for(i=0;i<=n;i++)
dp[0][i]=1LL*1e15,dp[1][i]=1LL*1e15;
mn[0]=1LL*1e15;dp[0][0]=0;
for(int cnt=1;cnt<=k;cnt++)
{
use=1-use;u=0;
for(i=1;i<=n;i++)
{
while(u>0&&v[i]>=v[st[u]])
u--;
st[++u]=i;
mn[u]=min(mn[u-1],dp[1-use][st[u-1]]+v[i]);
if(i>=cnt&&u==1)
mn[u]=min(dp[1-use][cnt-1]+v[i],mn[u]);
dp[use][i]=1LL*mn[u];
}
for(i=0;i<=n;i++)
dp[1-use][i]=1LL*1e15;
}
cout<<dp[use][n];
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |