Add solution

dynamic-programming/increasing-subsequence/README.md

@@ -0,0 +1,3 @@
+# Increasing Subsequence
+
+Problem page: <https://cses.fi/problemset/task/1145/>

dynamic-programming/increasing-subsequence/main.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+
+using namespace std;
+
+int main(){
+    int n{}, x{};
+    cin >> n;
+    vector<int> v;
+
+    for (int i = 0; i < n; i++){
+        cin >> x;
+        auto it = lower_bound(v.begin(), v.end(), x);
+        if (it == v.end()){
+            v.push_back(x);
+        }else{
+            *it = x;
+        }
+    }
+
+    cout << v.size() << "\n";
+
+    return 0;
+}