max_subarray.cpp

#include <bits/stdc++.h>
using namespace std;

vector<int> maxSlidingWindow(vector<int> &nums, int k)
{
    deque<int> dq;
    vector<int> ans;
    for (int i = 0; i < nums.size(); i++)
    {
        if (!dq.empty() && dq.front() == i - k)
            dq.pop_front();

        while (!dq.empty() && nums[dq.back()] < nums[i])
            dq.pop_back();

        dq.push_back(i);
        if (i >= k - 1)
            ans.push_back(nums[dq.front()]);
    }
    return ans;
}
int main()
{
    int n;
    cout<<"Enter the number of elements: "<<endl;
    cin>>n;
    vector<int> nums;
    cout<<"Enter the elements: "<<endl;
    for(int i=0; i<n; i++)
    {
        int z;
        cin>>z;
        nums[i]=z;
    }
    cout<<maxSlidingWindow(nums)<<endl;
    return 0;

}