Commit 3a74c45

committed

Adding description for LIS problem

1 parent d0d5ba8 commit 3a74c45Copy full SHA for 3a74c45

File tree

-0

lines changed

-0

lines changed

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,11 @@`
`1`	`1`	`#include <iostream>`
`2`	`2`	`using namespace std;`
	`3`	`+`
	`4`	`+/*`
	`5`	`+ The longest increasing subsequence problem is to find a subsequence of a given sequence in which`
	`6`	`+ he subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is`
	`7`	`+ as long as possible.`
	`8`	`+*/`
`3`	`9`
`4`	`10`	`int _lis(int arr[], int n, int* max_ref)`
`5`	`11`	`{`

Comments

(0)