STL中的容器非常优秀。它们提供了前向和逆向遍历的迭代器（通过begin、end、rbegin等）；它们能告诉你所容纳的对象类型（通过value_type的typedef）；在插入和删除中，它们负责任何需要的内存管理；它们报告容纳了多少对象和最多可能容纳的数量（分别通过size和max_size）；而且当然当容器自己被销毁时会自动销毁容纳的每个对象。
Containers in the STL are remarkably smart. They serve up iterators for both forward and reverse traversals (via begin, end, rbegin, etc.): they tell you what type of objects they contain (via their value_type typedef); during insertions and erasures, they take care of any necessary memory management; they report both how many objects they hold and the most they may contain (via size and max_size, respectively); and of course they automatically destroy each object they hold when they (the containers) are themselves destroyed.
Containers in STL are excellent.They offer iterators and reverse iterators(by begin,end,rgeging,etc.);they can tell you the type of the objects which they contain(by their value_type typedef); when inserting and deleting, they take charge of all the necessary memory management; they can report how many objects they have contained and how many objects they can contain(by size and max_size respectively); moreover of course a container destroys all the objects it holds when itself is destroyed. 

容器：containers
Sequence containers(序列式容器)容器中的顺序与插入元素无关，取决于插入的时间和地点
vector
vector 将元素置于dynamic array中，可以随机访问，不指定大小的连续存储，尾部进行push 和pop
#include <vector>
int main(){
	vector<int> array;
	for (int i=0;i<NUM;i++){

		array.push_back(i);
	}
	for (int j;j<array.size();j++)
		printf("%d",array[j]);
	return 0;
}

deque
deque 是一个双端队列，头尾都可以进行push/pop
#include <deque>
#include <stdio.h>
int main(){
	deque<int> dearray;
	for(int i=0;i<NUM;i++){
		dearray.push_front(i);
	}
	for(int j;j<dearray.size();j++){

		printf("%d",dearray[j]);
	}
	return 0;

}

list 双向链表
#include <list>
#include <stdio.h>
int main(){
	list<char> list_string;
	for(char i='a';i<='z';i++){

		list_string.push_back(i);
	}
	list_string.empty(); #判断容器是否为空
	front() #返回顶元素

	return 0;
}

Associative containers (关联式容器)取决于特定的排序准则
Sets
set是一个集合，默认会进行排序，支持集合的交差并等操作。
#include <set>

int main(){
	set<int> seta;  #默认是小于比较器
	set<int,greater<int> > setb;  #创建一个带大于比较器

	seta.insert(1); #插入
	seta.erase();  #删除一个元素
	seta.clear();	#删除容器中所有的元素
	seta.find();	#查找一个元素

	return 0;

}

MULtisets
存储键值对，多个键值对的key是可以重复的
#include <Multiset>
int main(){
	int array[]={1,2,3,4,5,6,7,8};
	multiset<int> seta(array,array+sizeof(array) /sizeof(int));

	return 0;
}

Maps
map 中的元素是键值对

#include
int main(){
	
	map<int,string> m;
	m.insert(map<int,string>::value_type(1,"one"))#插入key,value
	return 0;
}

Multimaps
键值对，key值不能重复，value可以重复