STL泛型算法，满足C元素搜索测试程序

模板函数 显示具体化 源代码,带你进入STL时代-Template function of the source code shows that the specific

著名的SGI的STL lib源码.(C++范型类编成,没有合适的分类,但是放到数据结构类别中也绝对适合)-famous SGI STL lib source. (C Fan-type establishment, and there is no suitable categories, but the data structure into categories have absolutely appropriate)

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

本书是一本有关于C++ 标准模板库的介绍的丛书 即使是拥有STl使用经验的人也可以从本书中学到新知识-This book is a book about C++ standard template library even though the introduction of the series is to have STl experience in the use of the people can learn new knowledge from this book,

说明：  简单的stl读取，显示，切片程序代码，简单的stl读取，显示，切片程序代码，简单的stl读取，显示，切片程序代码，(3d stl qiepian)

supplementary source file 1 for The BESTLibrary

这是关于几个数相加的一个简单例子，对初学者很有用-This is the number of add on a few examples of a simple, very useful for beginners

去除使用STL时编译warning-removed when using STL compiler warning

用stl实现多项式字符串相乘，用list实现，已测试。(Stl string using polynomial multiplication, with the list implementation, have been tested.)

说明：  求出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. )