Submission #134101

#	Time	Username	Problem	Language	Result	Execution time	Memory
134101		mirbek01	K blocks (IZhO14_blocks)	C++11	0 / 100	52 ms	40356 KiB

blocks

# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, a[N], k, dp[102][N];
int stk[N], pt, pf[N];

int main(){
	
	cin >> n >> k;
	
	for(int i = 1; i <= n; i ++)
		cin >> a[i];
	
	memset(dp, 0x3f3f3f3f, sizeof(dp));
	
	dp[1][1] = a[1];
	
	for(int i = 2; i <= n; i ++){
		dp[1][i] = max(dp[1][i - 1], a[i]);
	}
	
	for(int i = 2; i <= k; i ++){
		pt = 0;
		for(int j = 1; j <= n; j ++){
			while(pt >= 1 &&  a[ stk[pt] ] <= a[j])
				pt --;
			stk[++ pt] = i;
			pf[pt] = dp[i - 1][ stk[pt - 1] + 1 ] + a[j];
			if(pt > 1)
				pf[pt] = min(pf[pt], pf[pt - 1]);
			dp[i][j] = pf[pt];
		}
	}
	
	cout << dp[k][n] << endl;
}	

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