Submission #5738

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
5738	2014-05-15 02:34:07	kriii	K blocks (IZhO14_blocks)	C++98	100 / 100	124 ms	3040 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 <stdio.h>
int N,K,A[100001],prv[100001],nxt[100001];
int P[100001],Q[100001],sz;
int main()
{
  scanf ("%d %d",&N,&K);
  for (int i=1;i<=N;i++){
    scanf ("%d",&A[i]);
    prv[i] = 0x3fffffff;
  }
  while (K--){
    P[0] = 0; Q[0] = 0x3fffffff; sz = 0;
    nxt[0] = 0x3fffffff;
    
    for (int i=1;i<=N;i++){
      int last = prv[i-1];
      while (Q[sz] <= A[i]){
        if (last > P[sz]) last = P[sz];
        sz--;
      }
      if (P[sz] + Q[sz] > last + A[i]){
        sz++; P[sz] = last; Q[sz] = A[i];
      }
      nxt[i] = P[sz] + Q[sz];
    }
    for (int i=0;i<=N;i++) prv[i] = nxt[i];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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