SDU_week5_D - 滑动窗口（双端单调队列）

题目描述

分析

本题的目标是给定数组长度n和窗口大小k，找到每个窗口内的最大值和最小值。
解决方案是使用双端单调队列。队列中存放的是数组元素的下标。对于每个窗口的最小值，维护一个递增队列。此时的队首元素所对应的数组值就是当前窗口的最小值。对于每个窗口的最大值，维护一个递减队列。此时的队首元素所对应的数组值就是当前窗口的最大值。在for循环结束后可以直接输出，从而避免对内存资源的浪费。算法复杂度为O（n）。

关键点是，当新i来到时，计算（i-队列首元素）。若等于k，将其pop掉，从而维护窗口范围正确。

代码

#define _CRT_SECURE_NO_WARNINGS
#include<cstdio>
#include <iostream>
#include<queue>
using namespace std;

int arr[1000009];
//int max_num[1000009];
//int min_num[1000009];
deque<int> select_max;
deque<int> select_min;


int main()
{
    int n, k;
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++)
        scanf("%d", &arr[i]);

    if (k==1)
    {//窗口大小为1，最大值最小值相同且有n个
        for (int i = 1; i <= n; i++)
            printf("%d ", arr[i]);
        printf("\n");
        for (int i = 1; i <= n; i++)
            printf("%d ", arr[i]);
        return 0;
    }

    else
    {
        for (int i = 1; i <= k-1; i++)
        {//初始化
            if (select_min.empty() || arr[i] > arr[select_min.back()])
                select_min.push_back(i);
            else
            {
                while (!select_min.empty() && arr[i] < arr[select_min.back()])
                    select_min.pop_back();
                select_min.push_back(i);
            }
        }
//        printf("%d ", arr[select_min.front()]);
        for (int i = k; i <=n; i++)
        {
            if (i - select_min.front() == k)//元素已经不在窗口内
                select_min.pop_front();
            if (select_min.empty() || arr[i] > arr[select_min.back()])
                select_min.push_back(i);
            else
            {
                while (!select_min.empty() && arr[i] < arr[select_min.back()])
                    select_min.pop_back();
                select_min.push_back(i);
            }
            printf("%d ", arr[select_min.front()]);
        }


        printf("\n");


        for (int i = 1; i <= k-1; i++)
        {//初始化
            if (select_max.empty() || arr[i] < arr[select_max.back()])
                select_max.push_back(i);
            else
            {
                while (!select_max.empty() && arr[i] > arr[select_max.back()])
                    select_max.pop_back();
                select_max.push_back(i);
            }
        }
//        printf("%d ", arr[select_max.front()]);
        for (int i = k ; i <= n; i++)
        {
            if (i - select_max.front() == k)//元素已经不在窗口内
                select_max.pop_front();
            if (select_max.empty() || arr[i] < arr[select_max.back()])
                select_max.push_back(i);
            else
            {
                while (!select_max.empty() && arr[i] > arr[select_max.back()])
                    select_max.pop_back();
                select_max.push_back(i);
            }
            printf("%d ", arr[select_max.front()]);
        }
    }
    return 0;
}