lower_bound() 和 upper_bound() 使用二分法查找有序序列中的下界/上界的值，返回一个迭代器。
ForwardIter lower_bound(ForwardIter first, ForwardIter last,const _Tp& val)
返回一个非递减序列[first, last)中的第一个大于等于值val的位置。
ForwardIter upper_bound(ForwardIter first, ForwardIter last, const _Tp& val)
返回一个非递减序列[first, last)中第一个大于val的位置。
应注意大于等于和大于
挑一些不熟的、使用频率低的STL写，备忘用
vector, stack, queue等使用频率比较高，就不写了
参考了网上的一些文章
欢迎在评论区提意见~
|
1 2 3 4 5 6 7 |
#include <string> #include <list> int main() { list<string> Milkshakes; return 0; } |
|
1 2 3 4 5 6 7 8 9 10 11 12 |
#include <string> #include <list> int main (void) { list<string> Milkshakes; Milkshakes.push_back("Chocolate"); Milkshakes.push_back("Strawberry"); Milkshakes.push_front("Lime"); Milkshakes.push_front("Vanilla"); return 0; } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 |
#include <iostream.h> #include <string> #include <list> int main (void) { list<string> Milkshakes; list<string>::iterator MilkshakeIterator; Milkshakes.push_back("Chocolate"); Milkshakes.push_back("Strawberry"); Milkshakes.push_front("Lime"); Milkshakes.push_front("Vanilla"); // print the milkshakes Milkshakes.push_front("The Milkshake Menu"); Milkshakes.push_back("*** Thats the end ***"); for (MilkshakeIterator=Milkshakes.begin(); MilkshakeIterator!=Milkshakes.end(); ++MilkshakeIterator) { // dereference the iterator to get the element cout << *MilkshakeIterator << endl; } } |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 |
#include <iostream> #include <string> #include <list> #include <algorithm> using namespace std; void PrintIt(string& s) { cout << s << endl; } int main (void) { list<string> Milkshakes; list<string>::iterator MilkshakeIterator; Milkshakes.push_back("Chocolate"); Milkshakes.push_back("Strawberry"); Milkshakes.push_front("Lime"); Milkshakes.push_front("Vanilla"); // print the milkshakes Milkshakes.push_front("The Milkshake Menu"); Milkshakes.push_back("*** Thats the end ***"); for_each(Milkshakes.begin(), Milkshakes.end(), PrintIt); return 0; } |
|
1 |
list1.sort(); |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
//定义结构体 typedef struct NewTreeElem { long nNodeId; //节点id int nLevel; //层次 double dSoIn; //社会影响 }; //定义全局比较函数： boolCompInfo(NewTreeElem first, NewTreeElem second) { if(first.dSoIn <= second.dSoIn) //由大到小排序 return false; else return true; } |
|
1 2 3 4 5 6 7 |
//定义链表： list<NewTreeElem> listSocialInf //链表排序： listSocialInf.sort(CompInfo); |
|
1 2 |
list1.insert(iterator, value); list1.insert(list1.begin(), "aaa"); |
|
1 2 |
list1.erase(iterator); list1.erase(list1.begin()); |
|
1 2 |
list1.remove(value); list1.remove("aaa"); |
|
1 |
list1.pop_front(); |
|
1 2 3 4 |
listiter=find(listintegers.begin(),listintegers.end(),6); if(listiter==listintegers.end()) cout<<"6 is not in list"<<endl; else cout<<"6 is in list"<<endl; |
http://poj.org/problem?id=1852
两只蚂蚁相遇后相反方向走，等于两只蚂蚁相遇后不转向继续向前走，算蚂蚁距端点的距离即可
数据量较大，要用scanf读入，或者用cin加速
|
1 2 |
ios::sync_with_stdio(false); cin.tie(0); |
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 |
#include <iostream> #include <cstdio> #include <algorithm> using namespace std; #define INF 0x3F3F3F3F void solve() { int len, n; cin >> len >> n; int a[n]; for(int i = 0; i < n; i++) cin >> a[i]; int mint = 0, maxt = 0; for(int i = 0; i < n; i++) mint = max(mint, min(a[i], len - a[i])); for (int i = 0; i < n; i++) maxt = max(maxt, max(a[i], len - a[i])); cout << mint << " " << maxt << endl; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; while(n--) solve(); return 0; } |
