Create maximize-win-from-two-segments.cpp

Author: kamyu104

C++/maximize-win-from-two-segments.cpp

@@ -0,0 +1,19 @@
+// Time:  O(n)
+// Space: O(n)
+
+// two pointers, sliding window, dp
+class Solution {
+public:
+    int maximizeWin(vector<int>& prizePositions, int k) {
+        vector<int> dp(size(prizePositions) + 1);
+        int result = 0;
+        for (int right = 0, left = 0; right < size(prizePositions); ++right) {
+            while (prizePositions[right] - prizePositions[left] > k) {
+                ++left;
+            }
+            dp[right + 1] = max(dp[right], right - left + 1);
+            result = max(result, dp[left] + (right - left + 1));
+        }
+        return result;
+    }
+};