/C++/Longest increasing subsequence nlogn c++

Longest increasing subsequence nlogn c++

#include <bits/stdc++.h>
using namespace std;
 
int LongestIncreasingSubsequenceLength(std::vector<int>& v)
{
    if (v.size() == 0) // boundary case
        return 0;
 
    std::vector<int> tail(v.size(), 0);
    int length = 1; // always points empty slot in tail
 
    tail[0] = v[0];
 
    for (int i = 1; i < v.size(); i++) {
 
        // Do binary search for the element in
        // the range from begin to begin + length
        auto b = tail.begin(), e = tail.begin() + length;
        auto it = lower_bound(b, e, v[i]);
 
        // If not present change the tail element to v[i]
        if (it == tail.begin() + length)
            tail[length++] = v[i];
        else
            *it = v[i];
    }
 
    return length;
}
 
int main()
{
    std::vector<int> v{ 2, 5, 3, 7, 11, 8, 10, 13, 6 };
    std::cout
        << "Length of Longest Increasing Subsequence is "
        << LongestIncreasingSubsequenceLength(v);
    return 0;
}

-1

Similar codes

8 votes462 views1 answer
Venge io
C++
36 votes325 views4 answers
C++ hello world program
C++
2 votes334 views2 answers
Onclick show hide div jquery demo
C++
3 votes319 views1 answer
How i say hello world in c++
C++
1 vote339 views1 answer
Std means in programming
C++
1 vote335 views1 answer
Cpp std list example
C++
2 votes330 views2 answers
C++ random number between 1 and 10
C++
-1 vote322 views4 answers
How to say hello world in c++
C++
0 vote400 views1 answer
Make an x using asterisk c++
C++
0 vote327 views1 answer
C++ read matttrix from text file
C++