stl 中的排序算法

C++STL map操作实例介绍。主要演示map的操作技巧和方法。-C++ STL map operation introduce examples. The main demonstration of map skills and methods of operation.

Effective STL,一本经典学习stl的书籍，适合有一定stl基础的阅读-Effective STL, a classic learning stl books, suitable for a certain stl-based reading

用MATLAB编写遗传算法程序源代码 全部为m文件，可以直接在MATLAB里运行-Procedures for the preparation of genetic algorithms using MATLAB source code for all the m files, to run directly in MATLAB

单链表 数据结构中单链表 数据结构中单链表(Single linked list)

基本的STL的使用知识，涉及内容较全，如果全部掌握，对编程有很大帮助(Basic knowledge of the use of the STL involving than the whole, if all master programming)

改进版本的c＋＋类模版库和其原代码-improved version of the C++ Class Library template and its source

讲解c++标准库的书，英文版的，很好很强大-Explain c++ Standard library books, in English, very good strong

基于MFC和STL平台的字符串类，可以实现在快速字符串搜索。-MFC-based platform and STL string type, can achieve in the fast string search.

C++类模版库实现，包括全部原代码-C library of templates, including all source code

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