/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

7 votes277 views1 answer
Appending a vector to a vector in C++
C++
0 vote284 views1 answer
Vector of shared_ptr c++ push_back
C++
0 vote355 views2 answers
Is the c++ 20 char te same as the old one
C++
0 vote282 views1 answer
Rgb(100,100,100,0.5) validation c++
C++
5 votes269 views1 answer
C++ short if
C++
0 vote292 views1 answer
Tan ^-1 ti 83
C++
1 vote278 views1 answer
Qlabel font color
C++
0 vote296 views1 answer
Assignment of single field in struct in solidity
C++
0 vote268 views1 answer
Store array in vector
C++
24 votes293 views3 answers
C++ function
C++