Submission #5250

#TimeUsernameProblemLanguageResultExecution timeMemory
5250jspark19990205줄 세우기 (KOI13_jul)C++98
5.50 / 22
0 ms1124 KiB
#include<stdio.h>

int arr[10000];
int i,j;
int N;
int MAX=-1;

int main()
{
    scanf("%d",&N);
    for(i=0;i<N;i++)
    {
        scanf("%d",&j);
        arr[j]=arr[j-1]+1;
        if(MAX<arr[j])
            MAX=arr[j];
    }
    printf("%d\n",N-MAX);
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...