Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. All programs tested and work.

aviboots(AT)netvision.net.il

Instant Grammar Checker - Correct all grammar errors and enhance your writing
BlueHost Web Hosting

Profollica™ is a standout product in the hair regrowth industry.

New Arrival!  Shop NOW for metal eyeglasses at GlassesShop.com!

Bonsai Boy of New York Bonsai Trees and Accessories

DreamCloud The Comfortable Luxury Mattress Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

DreamHost Web Hosting


Liquid Web Cloud VPS Hosting

Disclosure We are a professional Programming & Software Q&A website, that receives compensation from some of the links whose we show you with Information. It means that my content may contain affiliate links.

14,039 questions

19,062 answers

573 users

How to find the longest increasing not sorted subsequence (LIS) of a sequence of numbers in C++

1 Answer

0 votes
#include <iostream>  

using namespace std; 
    
int not_sorted_lis(int arr[], int len) {   
    int total = 1;   
    
    for (int i = 0; i < len - 1; i++ ) { 
        if (arr[i] < arr[i + 1]) {
           total++;
        }
        cout << arr[i] << ' ' << arr[i + 1] << " total = " << total << endl;
    } 
  
    return total;
}  

    
int main()  
{  
    int arr[] = { 4, 5, 1, 10, 7, 9, 18, 19 }; 
    
    cout << "LIS length = " << not_sorted_lis(arr, sizeof(arr)/sizeof(arr[0]));  
    
    return 0;  
}



/*
run:

4 5 total = 2 
5 1 total = 2 
1 10 total = 3
10 7 total = 3
7 9 total = 4 
9 18 total = 5
18 19 total = 6 
LIS length = 6

*/

 




answered Jun 8, 2019 by avibootz
edited Jun 8, 2019 by avibootz
...