Welcome to collectivesolver - Programming & Software Q&A. A website you can trust. All programs tested and works. Contact: aviboots(AT)netvision.net.il
Bonsai Boy of New York Bonsai Trees and Accessories

BlueHost Web Hosting

Liquid Web Managed Dedicated Server: RAID 1 SSD with 16GB of RAM minimum! 24/7 On-Site Heroic Support! Industry-Leading SLA!

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

Ecommerce Software - Best Ecommerce Platform Made for You - Free Trial

getflywheel wordpress hosting


Liquid Web Cloud VPS Hosting

10,484 questions

14,262 answers

573 users

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

1 Answer

0 votes
def not_sorted_lis(arr, ln):
    total = 1
     
    for i in range(ln - 1):
        if (arr[i] < arr[i + 1]):
           total += 1
        print(arr[i], ' ', arr[i + 1], ' total =', total);

    return total
 

    
lst = [4, 5, 1, 10, 7, 9, 18, 19]
     
print("LIS length = ", not_sorted_lis(lst, len(lst)))  

    
    

'''
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 by avibootz
...