container:
Iterator:
Vector < int > :: Iterator ITER; iter1 = iter.bengn (); // element first address iter2 iter.end = (); // * ITER // address corresponding elements iter-> NEON // can be incremented from Canada; for (Vector < int > :: = ivec.begin ITER Iterator (); ITER ivec.end = (); ++ ITER * ITER = 0 ; Vector: variable array
Sequential container:
1.vector: Removing elements slow
2.list: doubly linked list, supports two-way access, insertion deletion quickly anywhere in the list
3.deque: deque, supports random access. Insert elements at the beginning and end soon.
4.string
Container adapter:
All adapters support:
stack:
queue:
Associated adapter:
1.map
2.set
3.multimap
4.multiset
greedy:
Rise longest sequence:
1.dp O (n ^ 2) f [i] = max (f [ik]]) + 1; i-th to the end of the longest sequence
2.O (nlogn) + greedy Division:
f [i]: length of rising value of the last element of the sequence of i;
If it encounters a smaller update
Large sequence length depends on the length of the sequence of small
Monotonically increasing, binary search: greater than or equal to the minimum of x.