diff --git a/c++/LIS.cpp b/c++/LIS.cpp
new file mode 100644
index 0000000..a221580
--- /dev/null
+++ b/c++/LIS.cpp
@@ -0,0 +1,40 @@
+//Program to print the length of longest increasing subsequence
+
+#include <bits/stdc++.h>
+using namespace std;
+
+#define int long long int
+
+int LIS(int n, int a[])
+{
+    int dp[n + 1];
+    for (int i = 1; i <= n; i++)
+        dp[i] = INT_MAX;
+    dp[0] = INT_MIN;
+
+    for (int i = 0; i < n; i++)
+    {
+        int idx = upper_bound(dp, dp + n + 1, a[i]) - dp;
+        if (a[i] > dp[idx - 1] && a[i] < dp[idx])
+            dp[idx] = a[i];
+    }
+
+    for (int i = n; i >= 0; i--)
+    {
+        if (dp[i] != INT_MAX)
+            return i;
+    }
+}
+
+int main()
+{
+    int n;
+    cin >> n;
+    int a[n];
+    for (int i = 0; i < n; i++)
+        cin >> a[i];
+
+    cout << LIS(n, a);
+
+    return 0;
+}
\ No newline at end of file