Submission #13268

#	Time	Username	Problem	Language	Result	Execution time	Memory
13268		dohyun0324	Skyline (IZhO11_skyline)	C++98	95 / 100	1499 ms	37432 KiB

skyline

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int dap=2147483647,n,a[310],d[210][210][210],mini[210][210];
int main()
{
    int i,j,k,l;
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&a[i]);
    for(i=1;i<=n;i++)
    {
        if(i==1) d[a[i]][0][0]=a[i]*3;
        else
        {
            for(j=0;j<=a[i];j++)
            {
                for(k=0;k<=a[i]-j;k++)
                {
                    l=a[i]-j-k;
                    if(i==1 && k) continue;
                    if(i<=2 && l) continue;
                    if(mini[k][l]!=2147483647) d[j][k][l]=3*j+2*k+2*l+mini[k][l];
                    if(d[j][k][l] && i==n && dap>d[j][k][l])
                    {
                        dap=d[j][k][l];
                    }
                }
            }
        }
        for(j=0;j<=201;j++){
            for(k=0;k<=201;k++){
                mini[j][k]=2147483647;
            }
        }
        for(j=a[i];j>=0;j--)
        {
            for(k=a[i]-j;k>=0;k--)
            {
                mini[j][k]=min(mini[j+1][k],mini[j][k+1]);
                l=a[i]-j-k;
                if(d[j][k][l] && mini[j][k]>d[j][k][l])
                {
                    mini[j][k]=d[j][k][l];
                }
            }
        }
        memset(d,0,sizeof d);
    }
    printf("%d",dap);
    return 0;
}

• Subtask 1: 95 / 100