added longest increasing subseq cpp

Author: nikhilgupta30

Algorithms/Dynamic Programming/Longest Increasing Subsequence/CPP/longestIncreasingSubsequence.cpp

@@ -0,0 +1,33 @@
+/* Dynamic Programming C++ implementation of LIS problem */
+#include<bits/stdc++.h> 
+using namespace std; 
+	
+int lis( int arr[], int n ) { 
+	int lis[n]; 
+
+	lis[0] = 1; 
+
+	for (int i = 1; i < n; i++ ) { 
+		lis[i] = 1; 
+		for (int j = 0; j < i; j++ ) 
+			if ( arr[i] > arr[j] && lis[i] < lis[j] + 1) 
+				lis[i] = lis[j] + 1; 
+	} 
+
+	return *max_element(lis, lis+n); 
+} 
+	
+// main function
+int main() { 
+  int n;
+  cout<<"enter size of array: ";
+  cin>>n;
+
+  int arr[n];
+  cout<<"enter elements: \n";
+  for(int i=0;i<n;i++) cin>>arr[i];
+
+	printf("Length of lis is %d\n", lis( arr, n ) );
+  
+	return 0; 
+}