some dp problems

CSES - CSES Problem Set/Sorting_And_Searching/Collecting_Numbers.cpp

@@ -0,0 +1,19 @@
+//  Collecting Numbers
+
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+    int n; cin >> n;
+    vector<int> in(n);
+    for (auto &e: in) cin >> e;
+    int count = 1;
+    map<int, int> pos;
+    for (int i{}; i < n; i++) pos[in[i]] = i;
+    for (int i = 1; i < n; i++) {
+        if (pos[i] > pos[i+1]) count ++;
+    }
+    cout << count << endl;
+    return 0;
+}