Submission #5311

#	Time	Username	Problem	Language	Result	Execution time	Memory
5311		baneling100	줄 세우기 (KOI13_jul)	C++98	22 / 22	180 ms	12804 KiB

jul

#include <stdio.h>

int n, a[1000001], b[1000001], d[1000001], ans;

void input(void)
{
    int i;

    scanf("%d",&n);
    for(i=1 ; i<=n ; i++)
    {
        scanf("%d",&a[i]);
        b[a[i]]=i;
    }
}

void process(void)
{
    int i;

    for(i=1 ; i<=n ; i++)
    {
        if(b[a[i]-1]<i)
            d[a[i]]=d[a[i]-1]+1;
        else
            d[a[i]]=1;
    }
    for(i=1 ; i<=n ; i++)
        if(ans<d[i])
            ans=d[i];
}

void output(void)
{
    printf("%d",n-ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

• Subtask 1: 2.2 / 2.2
• Subtask 2: 3.3 / 3.3
• Subtask 3: 3.3 / 3.3
• Subtask 4: 4.4 / 4.4
• Subtask 5: 4.4 / 4.4
• Subtask 6: 4.4 / 4.4