제출 #475115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
475115		vitural	K개의 묶음 (IZhO14_blocks)	C++17	100 / 100	359 ms	84576 KiB

blocks

// Solved by VituraL
#include <bits/stdc++.h>
#define pi pair<ll,ll>
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pb push_back
#define reset(a) memset(a,0,sizeof(a))
#define BIT_ON(mask, i) (mask | (1 << (i)))
#define BIT_OFF(mask, i) (mask ^ (1 << (i)))
#define C_BITS(i) __builtin_popcount(i)
#define GET_BIT(mask, i)    ((mask >> i) & 1)
#define BIT_CHECK(x,i) (x & i)
using namespace std;
///// khai bao bien cac thu /////
const int mod = 1e9+7;
const int maxn = 1e6+7;
const int oo = 0x3f3f3f3f;
ll n,k,a[maxn],f[maxn][105];
/*
f[i][j] la trong so nho nhat de chia j so dau thanh i nhom
 */
void solve()
{
    cin>>n>>k;
    for(ll i=1;i<=n;i++) cin>>a[i];
    for(ll i=1;i<=n;i++) f[i][1]=max(f[i-1][1],a[i]);
    for(ll i=2;i<=k;i++)
    {
        f[0][i]=oo;
        stack<pi> st;
        for(ll j=i;j<=n;j++)
        {
            ll maxx = f[j-1][i-1];
            while(!st.empty() && a[st.top().se] <= a[j])
            {
                maxx = min(maxx, st.top().fi);
                st.pop();
            }
            if(st.empty())
            {
                f[j][i]=min(f[0][i],maxx+a[j]);
            }
            else f[j][i] = min(f[st.top().se][i],maxx+a[j]);
            st.push({maxx,j});
        }
    }
    cout<<f[n][k];
}
///// main /////
main()
{
    //freopen("che.inp","r",stdin);
    //freopen("che.out","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    cout << endl;
    return 0;
}
// end.

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp:52:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   52 | main()
      | ^~~~

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