Submission #5330

#TimeUsernameProblemLanguageResultExecution timeMemory
5330jspark19990205줄 세우기 (KOI13_jul)C++98
5.50 / 22
0 ms1124 KiB
#include<stdio.h>
int a[9999];
int N;
int i,j;
int MAX=-1;
 
int main()
{
    scanf("%d",&N);
    for(i=1;i<=N;i++)
    {
        scanf("%d",&j);
        a[j]=a[j-1]+1;
        if(MAX<a[j])
            MAX = a[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...