# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1248398 | nguthianmangcay | K blocks (IZhO14_blocks) | C++20 | 1 ms | 328 KiB |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+3;
const int K=105;
const long long inf=1e18+3;
#define ll long long
#define fi first
#define se second
#define pi pair
ll a[N];
ll dp[K][N];
struct node
{
ll m;
ll b;
ll d;
};
void jiangly()
{
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
for(int i=0;i<=k;i++)
{
for(int j=0;j<=n;j++)
{
dp[i][j]=inf;
}
}
dp[0][0]=0;
for(int t=1;t<=k;t++)
{
vector<node>v;
v.push_back({0,dp[t-1][t-1],dp[t-1][t-1]});
for(int i=1;i<=n;i++)
{
ll best=dp[t-1][i-1];
while(!v.empty() && v.back().m <= a[i])
{
best=min(best,v.back().b);
v.pop_back();
}
ll nmin=best+a[i];
if(!v.empty())nmin=min(best+a[i],v.back().d);
v.push_back({a[i],best,nmin});
dp[t][i]=nmin;
}
}
cout<<dp[k][n];
}
int main()
{
cin.tie(0)->sync_with_stdio(0);
if(fopen("QUANSENSEI.inp","r"))
{
freopen("O(0).inp","r",stdin);
}
jiangly();
}
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... |