mirror of
https://hub.njuu.cf/TheAlgorithms/Python.git
synced 2023-10-11 13:06:12 +08:00
e6eaa078e2
* Pytest the entire repo
* Do each directory for now...
* YAML files hate tabs
* Add more requirements
* pip install opencv-python
* Comment out FTP
* Add pandas and sklearn to requirements
* Comment out FTP, graphs, machine_learning, maths, neural_network, project_euler
* Update .travis.yml
* Comment out Data structures
* if __name__ == "__main__":
* pytest --ignore=
* pytest .
* Update .travis.yml
* pytest . --doctest-modules --ignore=${IGNORE}
* Ignore --ignore because it just hangs
43 lines
855 B
Python
43 lines
855 B
Python
from __future__ import print_function
|
|
#############################
|
|
# Author: Aravind Kashyap
|
|
# File: lis.py
|
|
# comments: This programme outputs the Longest Strictly Increasing Subsequence in O(NLogN)
|
|
# Where N is the Number of elements in the list
|
|
#############################
|
|
def CeilIndex(v,l,r,key):
|
|
while r-l > 1:
|
|
m = (l + r)/2
|
|
if v[m] >= key:
|
|
r = m
|
|
else:
|
|
l = m
|
|
|
|
return r
|
|
|
|
|
|
def LongestIncreasingSubsequenceLength(v):
|
|
if(len(v) == 0):
|
|
return 0
|
|
|
|
tail = [0]*len(v)
|
|
length = 1
|
|
|
|
tail[0] = v[0]
|
|
|
|
for i in range(1,len(v)):
|
|
if v[i] < tail[0]:
|
|
tail[0] = v[i]
|
|
elif v[i] > tail[length-1]:
|
|
tail[length] = v[i]
|
|
length += 1
|
|
else:
|
|
tail[CeilIndex(tail,-1,length-1,v[i])] = v[i]
|
|
|
|
return length
|
|
|
|
|
|
if __name__ == "__main__":
|
|
v = [2, 5, 3, 7, 11, 8, 10, 13, 6]
|
|
print(LongestIncreasingSubsequenceLength(v))
|