Submission #53403

#	Time	Username	Problem	Language	Result	Execution time	Memory
53403		MatheusLealV	K blocks (IZhO14_blocks)	C++17	100 / 100	531 ms	99940 KiB

blocks

#include <bits/stdc++.h>
#define N 100010
#define K 110
#define inf 200000000000000000LL
#define f first
#define s second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;

ll n, k, v[N], dp[N][K], maior;

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>n>>k;

	for(int i = 1; i <= n; i++) cin>>v[i];

	for(int i = 0; i < N; i++)
		for(int j = 0; j < K; j++)
			dp[i][j] = inf;

	for(int i = 1; i <= n; i++)
	{
		maior = max(maior, v[i]);

		dp[i][1] = maior;
	}

	for(int q = 2; q <= k; q++)
	{
		stack < pii > W;

		for(int i = 1; i <= n; i++)
		{
			ll opt = dp[i - 1][q - 1];

			while(!W.empty() and W.top().f < v[i])
			{
				opt = min(opt, W.top().s);

				W.pop();
			}

			if(W.empty() or opt + v[i] < W.top().f + W.top().s) W.push({v[i], opt});

			if(i >= q) dp[i][q] = W.top().f + W.top().s;
		}
	}

	cout<<dp[n][k]<<'\n';
}

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