侯捷写的stl原码剖析

STL实践指南，一本学习STL不错的书，非常值得一看。(STL Guide to Practice, a good book to learn STL, worth a visit.)

STL切片算法,一种快速高效解决stl文件切片的程序算法讲解(STL slicing algorithm program algorithm, a fast and efficient solution stl file sections explain)

supplementary source file 1 for The BESTLibrary

stl Implementation source file

学习编程的经典资料 初学者必备 拥有理论性和实践性 -Programming information for beginners to learn the classic theoretical and practical must-have

c++ stl 实现的矩阵程序-c stl procedures to achieve the matrix

stl方面的很好的书籍-stl the good books

image file is used for image retrieval

一个二维数组，模板写的，内存连续，可以通过计算内存得到正确的数据，元素类型为T-a two-dimensional array, templates written in the continuous memory, memory can be correctly calculated data, elements of type T

说明：  求出sliding window的最大最小值(n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves rightwards by one position. Following is an example: The array is [1 3-1-3 5 3 6 7], and k is 3. Window position Minimum value Maximum value [1 3 -1]-3 5 3 6 7 -1 3 1 [3 -1 -3] 5 3 6 7 -3 3 1 3 [-1 -3 5] 3 6 7 -3 5 1 3 -1 [-3 5 3] 6 7 -3 5 1 3 -1 -3 [5 3 6] 7 3 6 1 3 -1 -3 5 [3 6 7] 3 7 Your task is to determine the maximum and minimum values in the sliding window at each position. )