STL
文章平均质量分 81
CODE_BALL
SDUT 计院学生一球
展开
-
Message Flood——MAP
Message Flood Time Limit:1500MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description Well, how do you feel about mobile phone? Your answer would probably原创 2014-08-05 21:17:47 · 774 阅读 · 0 评论 -
POJ 2503 Babelfish
Babelfish Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 33188 Accepted: 14269 Description You have just moved from Waterloo to a big city. The people her原创 2014-10-09 20:32:00 · 497 阅读 · 0 评论 -
STL总结
一:队列: (1):原创 2014-08-09 00:41:15 · 410 阅读 · 0 评论 -
合并果子之哈夫曼树——优先队列解决哈夫曼
树-堆结构练习——合并果子之哈夫曼树 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description 在一个果园里,多多已经将所有的果子打了下来,而且按果子的不同种类分成了不同的堆。多多决定把所有的果子合成一堆。 每一次合并,原创 2014-08-05 21:07:05 · 879 阅读 · 0 评论 -
Black Box——优先队列
Black BoxTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionOur Black Box represents a primitive database. It can save an integer array and has a speci原创 2014-08-05 20:28:44 · 549 阅读 · 0 评论 -
Fermat’s Chirstmas Theorem——素数筛
Fermat’s Chirstmas Theorem Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Description In a letter dated December 25, 1640; the great mathemati原创 2014-08-05 23:22:07 · 460 阅读 · 0 评论 -
For Fans of Statistics——vector
For Fans of Statistics Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Have you ever thought about how many people are transpor原创 2014-08-05 21:46:32 · 455 阅读 · 0 评论 -
Hardwood Species——MAP
Hardwood Species Time Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Hardwoods are the botanical group of trees that have broad le原创 2014-08-05 21:31:55 · 466 阅读 · 0 评论 -
Black Box——优先队列
Black Box Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Description Our Black Box represents a primitive database. It can save an integer原创 2014-08-05 20:25:50 · 797 阅读 · 0 评论 -
Surprising Strings——MAP
Surprising Strings Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description The D-pairs of a string of letters are the ordered pairs of原创 2014-08-05 21:39:50 · 453 阅读 · 0 评论 -
Sequence——优先队列
Sequence Time Limit:6000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description Given m sequences, each contains n non-negative integer. Now we may se原创 2014-08-05 20:57:59 · 733 阅读 · 0 评论