STL初步
文章平均质量分 73
风往北吹~
岂能尽随人愿,但求无愧我心。
展开
-
大理石在哪儿(UVa 10474)(排序与检索)
大理石在哪儿现有N个大理石,每个大理石上写了一个非负整数、首先把各数从小到大排序然后回答Q个问题。每个问题问是否有一个大理石写着某个整数x,如果是,还要回答哪个大理石上写着x。排序后的大理石从左到右编号为1~N。(在样例中,为了节约篇幅,所有大理石的数合并到一行,所有问题也合并到一行。)样例输入:4 12 3 5 155 21 3 3 3 1原创 2015-12-10 07:40:57 · 1117 阅读 · 0 评论 -
UVA10815 Andy's First Dictionary(STL)
Andy's First DictionaryAndy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instea原创 2015-12-10 19:44:11 · 1716 阅读 · 0 评论 -
C++ stringstream介绍,使用方法与例子
今天在学STL中 (集合:set)时,发现stringstream,然而并不知道什么意思。经过网上的查询,才知道是一种输入输出流,由于刚接触,感觉这博文感觉很有帮助,所以转载,供以后使用。http://blog.csdn.net/joeblackzqq/article/details/7032703C++引入了ostringstream、istr转载 2015-12-10 19:30:32 · 1148 阅读 · 0 评论 -
Smallest Difference(Poj2718)(枚举全排列next_Permutation)
Smallest DifferenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6664 Accepted: 1815DescriptionGiven a number of distinct decimal digits, you can form原创 2016-01-02 23:28:15 · 451 阅读 · 0 评论 -
Backward Digit Sums(poj3187)(STL next_permutation运用)
Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5440 Accepted: 3143DescriptionFJ and his cows enjoy playing a mental game. They write原创 2016-01-03 00:04:39 · 338 阅读 · 0 评论 -
看病要排队(杭电oj1873)(优先队列)
看病要排队Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6626 Accepted Submission(s): 2722Problem Description看病要排队这个是地球人都知道的常识。原创 2015-12-24 02:05:35 · 1047 阅读 · 0 评论 -
Windows Message Queue(杭电oj1509)(优先队列)
Windows Message QueueTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4852 Accepted Submission(s): 1936Problem DescriptionMess原创 2015-12-24 09:38:55 · 856 阅读 · 0 评论 -
The SetStack Computer(UVa12096&&POJ3121) (集合栈)
The SetStack ComputerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1095 Accepted: 219DescriptionBackground from Wikipedia: "Set theory is a branch of ma原创 2015-12-26 16:59:22 · 997 阅读 · 0 评论