제출 #5157

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
5157	2014-02-11 13:42:39	ainta	K개의 묶음 (IZhO14_blocks)	C++98	100 / 100	132 ms	41716 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
#include<stdio.h>
int D[101][100010];
int n, m, w[100010], st[100010][2];
int main()
{
  int i, j, top, x;
  scanf("%d%d", &n, &m);
  for (i = 1; i <= n; i++){
    scanf("%d", &w[i]);
    D[1][i] = w[i];
    if (i > 1 && D[1][i] < D[1][i - 1])D[1][i] = D[1][i - 1];
  }
  for (i = 1; i < m; i++){
    top = 0;
    for (j = i + 1; j <= n; j++){
      x = D[i][j - 1];
      while (top && st[top][0] <= w[j]){
        if (x>st[top][1])x = st[top][1];
        top--;
      }
      if (!top || x + w[j] < st[top][0] + st[top][1])st[++top][0] = w[j], st[top][1] = x;
      D[i + 1][j] = st[top][0] + st[top][1];
    }
  }
  printf("%d\n", D[m][n]);
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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