Create 1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position.cpp

Greedy/1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position/1964.Find-the-Longest-Valid-Obstacle-Course-at-Each-Position.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+    vector<int> longestObstacleCourseAtEachPosition(vector<int>& obstacles) 
+    {
+        vector<int>a;
+        vector<int>rets;
+        for (auto x: obstacles)
+        {
+            if (a.empty() || a.back()<= x)
+            {
+                a.push_back(x);
+                rets.push_back(a.size());
+            }
+            else
+            {
+                auto iter = upper_bound(a.begin(), a.end(), x);
+                *iter = x;
+                rets.push_back(iter - a.begin() + 1);
+            }                
+        }
+        return rets;        
+    }
+};