Add O(1)_MinMaxFilter.cpp

Author: BBuf

Algorithm optimization/O(1)_MinMaxFilter.cpp

@@ -0,0 +1,43 @@
+const int maxn = 110;
+deque <int> U, L;
+int maxval[maxn], minval[maxn];
+
+int main(){
+    int a[10] = {0, 1, 9, 8, 2, 3, 7, 6, 4, 5};
+    int w = 3;
+    for(int i = 1; i < 10; i++){
+        if(i >= w){
+            maxval[i - w] = a[U.size() > 0 ? U.front() : i-1];
+            minval[i - w] = a[L.size() > 0 ? L.front() : i-1];
+        }
+        if(a[i] > a[i-1]){
+            L.push_back(i - 1);
+            if(i == w + L.front()) L.pop_front();
+            while(U.size() > 0){
+                if(a[i] <= a[U.back()]){
+                    if(i == w + U.front()) U.pop_front();
+                    break;
+                }
+                U.pop_back();
+            }
+        }
+        else{
+            U.push_back(i-1);
+            if(i == w + U.front()) U.pop_front();
+            while(L.size() > 0){
+                if(a[i] >= a[L.back()]){
+                    if(i == w + L.front()) L.pop_front();
+                    break;
+                }
+                L.pop_back();
+            }
+        }
+    }
+    maxval[10 - w] = a[U.size() > 0 ? U.front() : 9];
+    minval[10 - w] = a[L.size() > 0 ? L.front() : 9];
+    for(int i = 0; i <= 10 - w; i++){
+        printf("Min index %d is: %d\n", i, minval[i]);
+        printf("Max index %d is: %d\n", i, maxval[i]);
+    }
+    return 0;
+}

Algorithm optimization/README.md

@@ -8,4 +8,6 @@
 - Huang_Fast_MedianBlur.cpp 利用直方图实现快速中值滤波算法，算法原理：https://blog.csdn.net/just_sort/article/details/87994573
 - speed_exp.cpp 在神经网络权值较小的情况下的快速exp算法，算法原理：https://blog.csdn.net/just_sort/article/details/88128200
 - fast_meanFilter.cpp 积分图实现o(1)均值滤波，代码来自ImageShop，算法原理：http://www.cnblogs.com/Imageshop/p/6219990.html
-- IntegralGraphforMeanFiltering.cpp 积分图实现O(1)均值滤波，算法原理：http://www.cnblogs.com/Imageshop/p/6219990.html
+- IntegralGraphforMeanFiltering.cpp 积分图实现O(1)均值滤波，算法原理：http://www.cnblogs.com/Imageshop/p/6219990.html
+- O(1)_MinMaxFilter.cpp 《STREAMING MAXIMUM-MINIMUM FILTER USING NO MORE THAN THREE COMPARISONS PER ELEMENT
+》论文复现，O(1)实现最大最小值滤波算法，算法原理：https://blog.csdn.net/just_sort/article/details/89424709