feat: WIP leetcode/leetcoding_challenge/2025/apr2025/week4/count_subarrays_with_fixed_bounds.cpp

Author: htbkoo

src/onlinePlatform/leetcode/leetcoding_challenge/2025/apr2025/week4/count_subarrays_with_fixed_bounds.cpp

@@ -28,7 +28,9 @@ class Solution {
         int right = 0;
         multiset<int> bst;        
         while (right < nums.size()) {
+            cout << "right: " << right << " nextInvalidIndices[right]: " << nextInvalidIndices[right] << endl;
             if (nums[right] < minK || nums[right] > maxK) {       
+                cout << "reset" << endl;
                 bst = multiset<int>();
                 right++;
                 left = right;
@@ -37,10 +39,22 @@ class Solution {
 
             bst.insert(nums[right]);
 
+            try {                
+                cout << right << " " ;
+                cout << *begin(bst) << " _ " ;
+                cout << *prev(end(bst)) << " __ ";
+                cout << *end(bst) << " ___ " << endl;
+            } catch (const std::exception& e) {
+                cout << " _e_ " << endl;
+            }
+            
             while (bst.size() > 0 && *begin(bst) == minK && *prev(end(bst)) == maxK) {
                 int count = nextInvalidIndices[right] - right;
+                cout << "add count: " << count << " answer:" << answer << endl;
                 answer += count;
                 bst.erase(nums[left]);
+
+                cout << "now: " << *begin(bst) << " _ " << *prev(end(bst)) << endl;
                 left++;
             }
 
@@ -60,8 +74,11 @@ class Solution {
 int main() {
     Solution soln;
 
-    vector<int> nums{1,3,5,2,7,5};
-    cout << soln.countSubarrays(nums, 1, 5) << endl;
+    // vector<int> nums{1,3,5,2,7,5};
+
+    // cout << soln.countSubarrays(nums, 1, 5) << endl;
+    vector<int> nums{35054,398719,945315,945315,820417,945315,35054,945315,171832,945315,35054,109750,790964,441974,552913};
+    cout << soln.countSubarrays(nums, 35054, 945315) << endl;
 
     return 0;
 }