Submission #1041915

#	Time	Username	Problem	Language	Result	Execution time	Memory
1041915		Minbaev	K blocks (IZhO14_blocks)	C++17	0 / 100	2 ms	2652 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;
vector<int>v(N);

void solve(){
	
	cin >> n >> k;
	for(int i = 1;i<=n;i++)cin >> v[i];
	
	int dp[k+1][n+1];
	for(int i = 0;i<=n;i++){
		for(int j = 0;j<=k;j++){
			dp[j][i] = inf;
		}
	}
	
	int mx = 0;
	for(int i = 1;i<=n;i++){
		umax(mx, v[i]);
		dp[1][i] = mx;
	}
	
	for(int j = 2;j<=k;j++){
		stack<pii>q;
		for(int i = j;i<=n;i++){
			int ans = dp[j-1][i-1];
			while(!q.empty() && v[q.top().f] < v[i]){
				umin(ans, q.top().s);
				q.pop();
			}
			if(!q.empty())dp[j][i] = q.top().s;
			dp[j][i] = min(dp[j][i], ans + v[i]);
			q.push({i, min(dp[j-1][i], ans)});
		}
	}
	
	cout << dp[k][n] << "\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: 0 / 14
• Subtask 2: 0 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47