제출 #341357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341357		amunduzbaev	K개의 묶음 (IZhO14_blocks)	C++14	100 / 100	201 ms	81704 KiB

blocks

/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define int long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

int n, m, k, ans, dp[105][N], a[N];

void solve(){
	cin>>n>>m;
	k = m;
	for(int i=1;i<=n;i++) cin>>a[i];
	for(int i=1;i<=n;i++) dp[1][i] = max(dp[1][i-1] , a[i]);
	for(int i=2;i<=k;i++){
		for(int j=1;j<=n;j++) dp[i][j] = mod;
	}
	
	for(int i=2;i<=k;i++){
		stack<pii> ss;
		for(int j=i;j<=n;j++){
			int tmp = dp[i-1][j-1];
			
			while(!ss.empty() && ss.top().ff <= a[j]) { umin(tmp, ss.top().ss); ss.pop(); }
			
			if(ss.empty() || ss.top().ff + ss.top().ss >= tmp+a[j]) ss.push({a[j], tmp});
			dp[i][j] = tmp + a[j];
			
			if(!ss.empty()) umin(dp[i][j], ss.top().ff + ss.top().ss);
		}
	}
	
	cout<<dp[k][n];
	return;
}

/*

9 3
2 5 1 7 3 4 3 2 1

*/

main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp:70:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      |      ^

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