Submission #563212

#	Time	Username	Problem	Language	Result	Execution time	Memory
563212		tamthegod	K blocks (IZhO14_blocks)	C++17	53 / 100	1072 ms	79448 KiB

blocks

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<bitset>
#include<chrono>
#include<random>
#include<ext/rope>
/* ordered_set
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e5 + 5;
const int maxK = 1e2 + 1;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, k, a[maxN];
int f[maxN][maxK];
void ReadInput()
{
    cin >> n >> k;
    for(int i=1; i<=n; i++) cin >> a[i];
}
void Solve()
{
    memset(f, 3, sizeof f);
    f[0][0] = 0;
    for(int i=1; i<=n; i++)
    {
        int _max = 0;
        for(int j=i; j>=1; j--)
        {
            _max = max(_max, a[j]);
            for(int t=1; t<=k; t++)
                f[i][t] = min(f[i][t], f[j - 1][t - 1] + _max);
        }
    }
    cout << f[n][k];
}
int32_t main()
{
   // freopen("x.inp", "r", stdin);
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

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