From 2661bc5b38de0324a59800198e8e61cb84a84eec Mon Sep 17 00:00:00 2001
From: AvinashYerra <101195675+AvinashYerra@users.noreply.github.com>
Date: Sat, 18 Nov 2023 16:02:18 +0530
Subject: [PATCH] Added Longest Increasing Subsequence code

---
 Array/Longest_increasing_subsequence.cpp | 42 ++++++++++++++++++++++++
 1 file changed, 42 insertions(+)
 create mode 100644 Array/Longest_increasing_subsequence.cpp

diff --git a/Array/Longest_increasing_subsequence.cpp b/Array/Longest_increasing_subsequence.cpp
new file mode 100644
index 00000000..bdd75912
--- /dev/null
+++ b/Array/Longest_increasing_subsequence.cpp
@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int lis(vector<int> &arr)
+{
+    int n = arr.size();
+    vector<int> lisLength(n, 1);
+
+    for (int i = 1; i < n; i++)
+    {
+        for (int j = 0; j < i; j++)
+        {
+            if (arr[i] > arr[j] && lisLength[i] < lisLength[j] + 1)
+            {
+                lisLength[i] = lisLength[j] + 1;
+            }
+        }
+    }
+
+    return *max_element(lisLength.begin(), lisLength.end());
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+
+    vector<int> arr(n);
+    for (int i = 0; i < n; i++)
+    {
+        cin >> arr[i];
+    }
+
+    int result = lis(arr);
+
+    cout << result << endl;
+
+    return 0;
+}