# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140655 | rzbt | K blocks (IZhO14_blocks) | C++14 | 178 ms | 4176 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>
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 100005
typedef long long ll;
using namespace std;
ll n,k;
ll niz[MAXN];
ll dpp[MAXN],dp[MAXN];
stack<pair<ll,ll> > s;
int main()
{
scanf("%lld %lld", &n, &k);
for(ll i=1;i<=n;i++)
scanf("%lld",niz+i);
dp[0]=dpp[0]=1e9;
ll tmax=0;
for(ll i=1;i<=n;i++){
tmax=max(tmax,niz[i]);
dpp[i]=tmax;
}
for(ll j=1;j<k;j++){
//for(ll i=1;i<=n;i++)printf(" %d\n",dpp[i]);
//printf("\n\n\n");
for(ll i=1;i<=n;i++){
ll tS = dpp[i-1];
while(!s.empty() && niz[s.top().F] < niz[i]){
tS=min(tS,s.top().S);
s.pop();
}
if(!s.empty())dp[i]=min(dp[s.top().F],niz[i]+tS);
else dp[i]=niz[i]+tS;
s.push(mp(i,tS));
}
for(ll i=1;i<=n;i++)dpp[i]=dp[i];
while(!s.empty())s.pop();
}
printf("%lld",dpp[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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |