제출 #7735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
7735		gs14004	줄 세우기 (KOI13_jul)	C++98	22 / 22	160 ms	4992 KiB

jul

#include <cstdio>
int n,a[1000005];
int isinCumul=1,howMuch=1,max;
int main(){
    int t;
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d",&t);
        a[t]=i+1;
    }
    for (int i=2; i<=n; i++) {
        if(a[i-1]<a[i]){
            isinCumul=1;
            howMuch++;
            if(max<howMuch) max=howMuch;
        }
        else if(isinCumul){
            isinCumul=0;
            if(max<howMuch) max=howMuch;
            howMuch=1;
        }
    }
    printf("%d",n-max);
}

• Subtask 1: 2.2 / 2.2
• Subtask 2: 3.3 / 3.3
• Subtask 3: 3.3 / 3.3
• Subtask 4: 4.4 / 4.4
• Subtask 5: 4.4 / 4.4
• Subtask 6: 4.4 / 4.4