oj.uz

답안 #13068

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13068 2015-01-29T18:06:57 Z dohyun0324 K개의 묶음 (IZhO14_blocks) C++
0 / 100
 1 ms 45228 KB 
#include<stdio.h>
#include<algorithm>
using namespace std;
int mini,n,k,a[100010],top,d[110][100010];
struct data{
    int x,mini;
}st[100010];
int main()
{
    int i,j;
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++) scanf("%d",&a[i]);
    for(i=1;i<=n;i++) d[1][i]=max(d[1][i-1],a[i]);
    for(i=2;i<=k;i++){
        top=0;
        for(j=i;j<=n;j++){
            mini=2147483647;
            while(st[top].x<=a[j] && top>0){
                mini=min(mini,st[top].mini);
                top--;
            }
            top++;
            st[top].mini=min(mini,d[i-1][j-1]);
            d[i][j]=st[top].mini+a[j];
            st[top].x=a[j];
        }
    }
    printf("%d",d[k][n]);
    return 0;
}

Subtask #1
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 45228 KB Output is correct
2 Correct 0 ms 45228 KB Output is correct
3 Correct 0 ms 45228 KB Output is correct
4 Correct 0 ms 45228 KB Output is correct
5 Correct 0 ms 45228 KB Output is correct
6 Correct 0 ms 45228 KB Output is correct
7 Correct 0 ms 45228 KB Output is correct
8 Correct 0 ms 45228 KB Output is correct
9 Correct 0 ms 45228 KB Output is correct
10 Correct 0 ms 45228 KB Output is correct
11 Correct 0 ms 45228 KB Output is correct
12 Correct 0 ms 45228 KB Output is correct
13 Incorrect 1 ms 45228 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #2
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #3
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -

Subtask #4
0.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Halted 0 ms 0 KB -