Create main.cpp

Author: JawadSher

16 - Queue Data Structure Problems/01 - Linear Queue Problems/12 - Sum of Minimum and Maximum Elements of All Subarrays of Size K/main.cpp

@@ -0,0 +1,48 @@
+#include <iostream>
+#include <deque>
+using namespace std;
+
+int solve(int *arr, int n, int k){
+  deque<int> maxi(k);
+  deque<int> mini(k);
+
+  // Addition of first k size window
+  for(int i = 0; i < k; i++){
+    while(!maxi.empty() && arr[maxi.back()] <= arr[i]) maxi.pop_back();
+    while(!mini.empty() && arr[mini.back()] >= arr[i]) mini.pop_back();
+
+    maxi.push_back(i);
+    mini.push_back(i);
+  }
+
+  int ans = 0;
+  ans += arr[maxi.front()] + arr[mini.front()];
+
+  // Process remaining windows
+  for(int i = k; i < n; i++){
+
+    // next window
+      // removal
+      while(!maxi.empty() && i - maxi.front() >= k) maxi.pop_front();
+      while(!mini.empty() && i - mini.front() >= k) mini.pop_front();
+
+      // Addition
+      while(!maxi.empty() && arr[maxi.back()] <= arr[i]) maxi.pop_back();
+      while(!mini.empty() && arr[mini.back()] >= arr[i]) mini.pop_back();
+
+    maxi.push_back(i);
+    mini.push_back(i);
+
+    ans += arr[maxi.front()] + arr[mini.front()];
+  }
+
+  return ans;
+}
+
+int main() {
+  int arr[7] = {2, 5, -1, 7, -3, -1, -2};
+  int k = 4;
+
+  cout << "Result : " << solve(arr, 7, k) << endl;
+  return 0;
+}