Introduction - If you have any usage issues, please Google them yourself
Seeking the longest monotonically increasing subsequence. For example: The original array: 1 5 1,315,621,686,216,522,159 62 1 3 5,631,156,311,663,166,316 6 1 Results: the longest monotonically increasing sub- sequence: Length: 14 Content: 1 1 1 1 1 1 1 1 1 1 6 6 6 6