//给定一数组，找到指定滑动窗口中的最大值 //使用两端开口的队列deque

#include <iostream>
#include<stdio.h>
#include<deque>
#include<vector>
using namespace std;

vector<int> maxInWindows(const vector<int>& numbers, unsigned int sizee){
    vector<int> maxInWindows;
    if(numbers.size()>=sizee && sizee>=1){
        deque<int> index;//队列中的下标
        for(unsigned int i=0;i<sizee;i++){//滑动窗口没有填满
            while(!index.empty() && numbers[i]>=numbers[index.back()])//已有的数据小于待存入的数据，那么它不可能是最大值，所以从队列尾部删除
                index.pop_back();
            index.push_back(i);
        }
        for(unsigned int i=sizee;i<numbers.size();++i){//
            maxInWindows.push_back(numbers[index.front()]);

            while(!index.empty() && numbers[i]>=numbers[index.back()])//已有的数据小于待存入的数据，那么它不可能是最大值，所以从队列尾部删除
                index.pop_back();

            if(!index.empty() && index.front()<=(int)(i-sizee))//滑出这个窗口，无论值多大，都从队列的头部删除
                index.pop_front();

            index.push_back(i);//插入新数据的下标，有可能成为最大值
        }
        maxInWindows.push_back(numbers[index.front()]);//index的首部front始终存放滑动窗口的最大值的下标
    }
    return maxInWindows;//滑动窗口的最大值

}

// ==================== Test Code ====================
void Test(char* testName, const vector<int>& num, unsigned int size, const vector<int>& expected)
{
    if(testName != NULL)
        printf("%s begins: ", testName);

    vector<int> result = maxInWindows(num, size);

    vector<int>::const_iterator iterResult = result.begin();
    vector<int>::const_iterator iterExpected = expected.begin();
    while(iterResult < result.end() && iterExpected < expected.end())
    {
        if(*iterResult != *iterExpected)
            break;

        ++iterResult;
        ++iterExpected;
    }

    if(iterResult == result.end() && iterExpected == expected.end())
        printf("Passed.\n");
    else
        printf("FAILED.\n");
}

void Test1()
{
    int num[] = {2, 3, 4, 2, 6, 2, 5, 1};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {4, 4, 6, 6, 6, 5};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 3;

    Test("Test1", vecNumbers, size, vecExpected);
}

void Test2()
{
    int num[] = {1, 3, -1, -3, 5, 3, 6, 7};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {3, 3, 5, 5, 6, 7};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 3;

    Test("Test2", vecNumbers, size, vecExpected);
}

// increasingly sorted
void Test3()
{
    int num[] = {1, 3, 5, 7, 9, 11, 13, 15};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {7, 9, 11, 13, 15};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 4;

    Test("Test3", vecNumbers, size, vecExpected);
}

// decreasingly sorted
void Test4()
{
    int num[] = {16, 14, 12, 10, 8, 6, 4};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {16, 14, 12};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 5;

    Test("Test4", vecNumbers, size, vecExpected);
}

// size of sliding windows is 1
void Test5()
{
    int num[] = {10, 14, 12, 11};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {10, 14, 12, 11};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 1;

    Test("Test5", vecNumbers, size, vecExpected);
}

// size of sliding windows is same as the array length
void Test6()
{
    int num[] = {10, 14, 12, 11};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    int expected[] = {14};
    vector<int> vecExpected(expected, expected + sizeof(expected) / sizeof(int));

    unsigned int size = 4;

    Test("Test6", vecNumbers, size, vecExpected);
}

// size of sliding windows is 0
void Test7()
{
    int num[] = {10, 14, 12, 11};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    vector<int> vecExpected;

    unsigned int size = 0;

    Test("Test7", vecNumbers, size, vecExpected);
}

// size of sliding windows is greater than the array length
void Test8()
{
    int num[] = {10, 14, 12, 11};
    vector<int> vecNumbers(num, num + sizeof(num) / sizeof(int));

    vector<int> vecExpected;

    unsigned int size = 5;

    Test("Test8", vecNumbers, size, vecExpected);
}

int main(int argc, char* argv[])
{
    Test1();
    Test2();
    Test3();
    Test4();
    Test5();
    Test6();
    Test7();
    Test8();

    return 0;
}