Submission #5251

#	Time	Username	Problem	Language	Result	Execution time	Memory
5251		jihoon	줄 세우기 (KOI13_jul)	C++98	0 / 22	152 ms	8900 KiB

jul

#include<cstdio>
int mx=1;
int dp[1000001][2]={0};
int main(){
    int n,i,ia;
    scanf("%d",&n);
    for(i=0;i<n;i++){
        scanf("%d",&dp[i][0]);
    }
    dp[0][1]=1;
    for(i=1;i<n;i++){
        if(dp[i][0]>dp[i-1][0]&&(dp[i][0]!=n||i==n-1)&&dp[i][0]!=1){
            dp[i][1]=dp[i-1][1]+1;
            if(mx<dp[i][1]) mx=dp[i][1];
        }else{
            dp[i][1]=1;
        }
    }
    printf("%d",n-mx);
}

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