Submission #14805

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
14805	2015-06-26 15:33:11	erdemkiraz	K blocks (IZhO14_blocks)	C++98	100 / 100	182 ms	3672 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 <iostream>
using namespace std;
const int inf = 1e9 + 5;
const int N = 1e5 + 5;
int n, k, a[N], dp[N], bef[N];
pair < int, int > p[N];
int main () {
    
    cin >> n >> k;
    
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        bef[i] = max(bef[i - 1], a[i]);
    }
    
    for(int j = 2; j <= k; j++) {
        int sz = 0;
        for(int i = 1; i <= n; i++) {
            int ans = j <= i ? bef[i - 1] : inf;
            bef[i - 1] = dp[i - 1];
            while(sz and a[i] >= p[sz - 1].first)
                ans = min(ans, p[--sz].second);
            if(!sz or a[i] + ans < p[sz - 1].first + p[sz - 1].second)
                p[sz++] = make_pair(a[i], ans);
            dp[i] = p[sz - 1].first + p[sz - 1].second;
        }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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