| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 4267 | dbfud | 줄 세우기 (KOI13_jul) | C++98 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
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;
}
