Submission #1040184

#	Time	Username	Problem	Language	Result	Execution time	Memory
1040184		Minbaev	K blocks (IZhO14_blocks)	C++17	53 / 100	1028 ms	4952 KiB

blocks

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> 
 
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("Ofast,unroll-loops")
 
using namespace std;
using namespace __gnu_pbds;
 
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define f first
#define s second
#define int long long
#define pii pair<int,int>
#define ar array
 
template<class T>bool umax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T>bool umin(T &a,T b){if(b<a){a=b;return true;}return false;}
 
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
 tree_order_statistics_node_update> ordered_set;
 
const int inf = 1e17 + 7;
const int mod = 1e9 + 7;
const int N = 3e5 + 5;
const int md = 998244353;

int binpow(int a, int b){
	if(b == 0)return 1;
	if(b % 2 == 0){
		int c = binpow(a,b/2);
		return (c*c)%mod;
	}
	return (binpow(a,b-1)*a)%mod;
}

int divi(int a, int b){
	return (a*(binpow(b,mod-2)))%mod;
}

int n,m,k;
int t[N*4];
vector<int>v(N);

void build(int tl, int tr, int vs){
	if(tl == tr){
		t[vs] = v[tl];
		return;
	}
	int tm = (tl+tr)/2;
	
	build(tl, tm, vs*2);
	build(tm+1, tr, vs*2+1);
	t[vs] = max(t[vs*2], t[vs*2+1]);
}

int get(int tl, int tr, int v, int l, int r){
	if(l > tr || r < tl)return 0;
	
	if(l <= tl && tr <= r){
		return t[v];
	}
	int tm = (tl+tr)/2;
	
	return max(get(tl,tm,v*2,l,r),get(tm+1,tr,v*2+1,l,r));
}

void solve(){
	
	cin >> n >> k;
	
	for(int i = 1;i<=n;i++)cin >> v[i];
	
	int dp[n+1][k+1];
	for(int i = 0;i<=n;i++){
		for(int j = 0;j<=k;j++){
			dp[i][j] = inf;
		}
	}
	
	build(1,n,1);
	//~ cout << get(1,n,1,1,n);
	
	for(int i = 1;i<=n;i++){
		dp[i][1] = get(1,n,1,1,i);
		for(int j = i-1;j>0;j--){
			for(int l = 1;l<min(i,k);l++){
				umin(dp[i][l+1], dp[j][l] + get(1,n,1,j+1,i));
			}
		}
	}
	
	cout << dp[n][k] << "\n";
	
}
/*

*/
 signed main()
{
//	freopen("seq.in", "r", stdin);
//  freopen("seq.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
	int tt=1;//cin>>tt;
	while(tt--)solve();
 
}
 

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