init

24/11/3243.cpp

@@ -0,0 +1,27 @@
+#include <vector>
+using namespace std;
+
+vector<int> shortestDistanceAfterQueries(int n, vector<vector<int>> &queries)
+{
+    vector<vector<int>> prev(n);
+    vector<int> dp(n);
+    for (int i = 1; i < n; i++)
+    {
+        prev[i].push_back(i - 1);
+        dp[i] = i;
+    }
+    vector<int> res;
+    for (auto &query : queries)
+    {
+        prev[query[1]].push_back(query[0]);
+        for (int v = query[1]; v < n; v++)
+        {
+            for (int u : prev[v])
+            {
+                dp[v] = min(dp[v], dp[u] + 1);
+            }
+        }
+        res.push_back(dp[n - 1]);
+    }
+    return res;
+}