Submission #16224

#TimeUsernameProblemLanguageResultExecution timeMemory
16224eaststar줄 세우기 (KOI13_jul)C++14
22 / 22
178 ms12800 KiB
#include <stdio.h>
int a[1000010],chk[1000010],s[1000010],mx;
int main(){
    int i,n;
    scanf("%d",&n);
    for(i=1;i<=n;++i){
        scanf("%d",&a[i]);
        chk[a[i]]=1;
        if(chk[a[i]-1])s[a[i]]=s[a[i]-1]+1;
        if(mx<s[a[i]])mx=s[a[i]];
    }
    printf("%d",n-mx-1);
    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...