Submission #13069

#	Time	Username	Problem	Language	Result	Execution time	Memory
13069		dohyun0324	K blocks (IZhO14_blocks)	C++98	100 / 100	170 ms	45620 KiB

blocks

#include<stdio.h>
#include<algorithm>
using namespace std;
int mini,n,k,a[100010],top,d[110][100010];
struct data{
    int x,mini,p;
}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; d[i][0]=2147483647;
        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]=min(d[i][st[top-1].p],st[top].mini+a[j]);
            st[top].x=a[j]; st[top].p=j;
        }
    }
    printf("%d",d[k][n]);
    return 0;
}

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