Submission #119735

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
119735	2019-06-22 05:23:35	dolphingarlic	K blocks (IZhO14_blocks)	C++14	100 / 100	721 ms	80664 KiB

blocks

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
stack<int> s;
int main() {
    int n, k;
    cin >> n >> k;
    int arr[n + 1];
    for (int i = 1; i <= n; ++i) cin >> arr[i];
    int dp[n + 1][k + 1];
    int chosen[n + 1][k + 1];
    dp[0][1] = 0;
    for (int i = 1; i <= n; ++i)
        dp[i][1] = max(arr[i], dp[i - 1][1]), chosen[i][1] = dp[i][1];
    for (int j = 2; j <= k; ++j) {
        while (s.size() > 0) s.pop();
        for (int i = j; i <= n; ++i) {
            dp[i][j] = dp[i - 1][j - 1] + arr[i];
            chosen[i][j] = arr[i];
            while (s.size() > 0) {
                int idx = s.top();
                if (arr[idx] <= arr[i]) {
                    if (dp[idx][j] - chosen[idx][j] +
                            max(chosen[idx][j], arr[i]) <
                        dp[i][j]) {
                        dp[i][j] = dp[idx][j] - chosen[idx][j] +
                                   max(chosen[idx][j], arr[i]);
                    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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