Breaking News: Grepper is joining You.com. Read the official announcement!

longest increasing subsequence nlogn c++

Tame Tapir answered on January 3, 2022 Popularity 9/10 Helpfulness 1/10

answer longest increasing subsequence nlogn c++

longest increasing subsequence nlogn c++

Comment

-1

#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;
}

Popularity 9/10 Helpfulness 1/10 Language cpp

Source: Grepper

Tags: c++ subsequence

Link to this answer
Share Copy Link

Contributed on Jan 03 2022

Tame Tapir

0 Answers Avg Quality 2/10

longest increasing subsequence nlogn c++

Contents

More Related Answers

longest increasing subsequence nlogn c++

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.