제출 #4268

#제출 시각아이디문제언어결과실행 시간메모리
4268dbfud줄 세우기 (KOI13_jul)C++98
0 / 22
480 ms7820 KiB
#include <iostream>
#include <vector>
using namespace std; 

int main()
{
    int numChild = 0 ;
    cin >> numChild ;
    
    vector<int> Child ;
    int child_data ; 
    for( int i = 0; i < numChild ; i++ )
    {
         cin >> child_data ; 
         Child.push_back(  child_data ) ; 
    }
    
    int Count = 1; 
    int Max = 0 ; 
    
    for ( int i = 0; i < numChild ; i++ )
    {
        if ( Child[i] < Child[i+1] ) 
           Count++ ;
        else 
           Count = 0 ;
        
        if ( Count > Max )
           Max = Count ; 
        
    }
    
    cout << numChild - 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...