oj.uz

Submission #4268

# Submission time Handle Problem Language Result Execution time Memory
4268 2013-09-08T04:42:20 Z dbfud 줄 세우기 (KOI13_jul) C++
0 / 22
 480 ms 7820 KB 
#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;
}

Subtask #1
0.0 / 2.2

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 3.3

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 3.3

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 4.4

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 1804 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 4.4

# Verdict Execution time Memory Grader output
1 Incorrect 244 ms 4748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 4.4

# Verdict Execution time Memory Grader output
1 Incorrect 480 ms 7820 KB Output isn't correct
2 Halted 0 ms 0 KB -