Submission #4579

#TimeUsernameProblemLanguageResultExecution timeMemory
4579KH_Lee0415줄 세우기 (KOI13_jul)C++98
22 / 22
164 ms4992 KiB
#include<stdio.h>
int num[1000001];
int main(){
    int N,i,a,max=0;
    scanf("%d",&N);
    for(i=1; i<=N; i++){
        scanf("%d",&a);
        num[a]=num[a-1]+1;
        if(max<num[a])max=num[a];
    }
    printf("%d",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...