Submission #698336

#	Time	Username	Problem	Language	Result	Execution time	Memory
698336		yuuCG	K blocks (IZhO14_blocks)	C++14	0 / 100	0 ms	340 KiB

blocks

#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
#define FOR(i,a,b) for(ll i=a;i<=b;i++)
#define FORD(i,a,b) for(ll i=a;i>=b;i--)
#define MAXN 100005
#define MAXK 102
#define pb push_back
#define TASK "name"
#define ff first
#define ss second
#define oo 4557430888798830399
#define ll long long
#define pii pair<long long,long long>
using namespace std;
bool minimize(ll &a,ll b)
{
    if (a>b)
    {
        a=b;
        return true;
    }
    return false;
}
bool maximize (ll &a,ll b)
{
    if (a<b)
    {
        a=b;
        return true;
    }
    return false;
}
ll dp[MAXK+1][MAXN+1];
ll n,k;
ll a[MAXN+1];
void nhap()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen (TASK".inp","r",stdin);
  //freopen (TASK".out","w",stdout);
  cin >> n >> k;
  FOR(i,1,n) cin >> a[i];
}
void solve()
{
    ll res=0;
    FOR(i,1,n)
    {
        res=max(res,a[i]);
        dp[1][i]=res;
    }
    FOR(i,2,k)
    {
        stack<ll> s1,s2;
        FOR(j,1,n)
        {
            ll last_dp=dp[i-1][j-1];
            while (!s1.empty()&&s1.top()<a[j])
            {
               last_dp=min(last_dp,s2.top());
                s1.pop();
                s2.pop();
            }
            if (s1.empty()||last_dp+a[j]<s1.top()+s2.top())
            {
                s1.push(a[j]);
                s2.push(last_dp);
            }
            if (j>=i) dp[i][j]=s1.top()+s2.top();
        }
    }
    cout << dp[k][n];
}
int main()
{
    nhap();
    solve();
    return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47