class Solution {public:    int lengthOfLongestSubstring(string s) {        if(s.size() == 0) return 0;//根据题目实例来特判一个        unordered_set<char> lookup;//在set中每个元素的值都唯一，而且系统能根据元素的值自动进行排序        int maxStr = 0;        int left = 0;        for(int i = 0; i < s.size(); i++){            while (lookup.find(s[i]) != lookup.end()){                lookup.erase(s[left]);                left ++;            }            maxStr = max(maxStr,i-left+1);            lookup.insert(s[i]);    }        return maxStr;            }};

#include<iostream>using namespace std;int h,t=-1;const int N=1e6+10;int a[N],q[N];int main(){    int n,k;    cin>>n>>k;    for(int i=0;i<n;i++) cin>>a[i];        for(int i=0;i<n;i++)    {        if(h<=t && i-q[h]+1>k) h++;        while(h<=t && a[q[t]]>=a[i]) t--;        q[++t]=i;        if(i+1>=k) cout<<a[q[h]]<<' ';    }    cout<<endl;    h=0;t=-1;     for(int i=0;i<n;i++)    {        if(h<=t && i-q[h]+1>k) h++;        while(h<=t && a[q[t]]<=a[i]) t--;        q[++t]=i;        if(i+1>=k) cout<<a[q[h]]<<' ';    }    return 0;}

class MovingAverage {private:    int len = 0;    queue<int> nums;    double sum = 0;public:    MovingAverage(int size) {        len = size;    }        double next(int val) {        nums.push(val);        sum += val;        if (nums.size() > len) {            sum -= nums.front();            nums.pop();        }        return sum / nums.size();    }};