Blocks

#include <iostream>
#include <string>
#include<vector>
using namespace std;

void best_insert(vector<int>* v, int s){
    if(v->empty()||s>(*v)[v->size()-1]){
        v->push_back(s);
        return;
    }
    int alku=0;
    int loppu=v->size()-1;
    while(loppu-alku>5){
        int keski = (loppu+alku)/2;
        if((*v)[keski]>=s){
            loppu=keski;
        } else{
            alku=keski;
        }
    }
    for(int i=alku;i<=loppu;++i){
        if((*v)[i]>s){
            (*v)[i]=s;
            return;
        }
    }

}

int main(){
	cin.sync_with_stdio(false);
    int n;
    cin>>n;
    vector<int> v;
    for(int i=0;i<n;i++){
        int s;
        cin>>s;
        best_insert(&v,s);
    }
    cout<<v.size()<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED