Submission #380559

#	Time	Username	Problem	Language	Result	Execution time	Memory
380559		SavicS	K blocks (IZhO14_blocks)	C++14	53 / 100	2 ms	492 KiB

blocks

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,b,a) for(int i=b;i>=a;i--)

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn = 105;
const int inf = 1e9 + 5;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

int n, k;
int niz[maxn];

int dp[maxn][maxn];

int main()
{
   	ios::sync_with_stdio(false);
   	cout.tie(nullptr);
  	cin.tie(nullptr);
	cin >> n >> k;
	ff(i,1,n)cin >> niz[i];
	ff(i,0,n){
		ff(j,0,k)dp[i][j] = inf;
	}
	dp[0][0] = 0;
	ff(i,1,n){
		ff(j,1,k){
			int mx = 0;
			fb(l,i,1){
				mx = max(mx, niz[l]);
				dp[i][j] = min(dp[i][j], mx + dp[l - 1][j - 1]);
			}
		}
	}
	cout << dp[n][k] << endl;
   	return 0;
}
/**

5 1
1 2 3 4 5

5 2
1 2 3 4 5


// probati bojenje sahovski ili slicno

**/

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