제출 #2544

#제출 시각아이디문제언어결과실행 시간메모리
2544club4208줄 세우기 (KOI13_jul)C++98
22 / 22
168 ms4992 KiB
#include <stdio.h>
int n,t,d[1000001],i,max=0;
int main(){
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&t);
    d[t]=d[t-1]+1;
    if(max<d[t])max=d[t];
  }
  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...