STL
果7
曾就职于阿里巴巴,从事搜索推荐的应用算法工作。
展开
-
STL用法(转自吉吉)
(七)set类的主要成员set是一种集合容器。☆void clear();//删除所有元素☆bool empty() const; //返回是否为空☆void erase(iterator position);//删除在位置position的元素 //貌似也可以直接删除值☆iterator find(const key_type& x)const;//返回索引为x的元转载 2013-08-08 20:36:16 · 1431 阅读 · 0 评论 -
HDU 4339 Query2012多校联赛第四场I题(set或者线段树,下面是set解法)
QueryTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2074 Accepted Submission(s): 713Problem DescriptionYou are given two s原创 2013-08-08 21:15:12 · 1146 阅读 · 0 评论 -
HDU 2609 How many(最小表示法+set判重两种写法)
How manyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1028 Accepted Submission(s): 403Problem DescriptionGive you n ( n H原创 2013-08-09 14:51:36 · 1356 阅读 · 0 评论 -
HDU 4584Shaolin2012杭州全国邀请赛J题(暴力或set 两种做法)
ShaolinTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 271 Accepted Submission(s): 141Problem DescriptionShaolin temple is ve原创 2013-08-11 08:41:32 · 1415 阅读 · 0 评论 -
HDU 4022Bombing 2011网络赛(二分 或 STL)
BombingTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 1884 Accepted Submission(s): 703Problem DescriptionIt’s a cruel war wh原创 2013-10-05 16:40:52 · 1623 阅读 · 0 评论 -
Codeforces Round #207 (Div. 2)C. Knight Tournament(SET也可以搞定)
C. Knight Tournamenttime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHooray! Berl II, the king of Berland i原创 2013-10-17 18:12:30 · 1288 阅读 · 0 评论 -
POJ 3253Fence Repair(哈夫曼&优先队列)
Fence RepairTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 21545 Accepted: 6875DescriptionFarmer John wants to repair a small length of the fence aroun原创 2014-01-10 15:25:24 · 1163 阅读 · 0 评论 -
SGU 271Book Pile(模拟 deque+stack)
271. Book Piletime limit per test: 0.25 sec.memory limit per test: 65536 KBinput: standardoutput: standardThere is a pile of N books on the table. Two types of operations are p原创 2014-01-12 10:27:01 · 1269 阅读 · 0 评论