摘要：
/*【题目来源】http://poj.org/problem?id=1128【题目分析】几张图片叠在一起，给出堆叠后的情况，要求出所有可能的从下到上的堆叠顺序。【思路分析】 1.题目已经很明确的告诉每个边框的每条边，至少会有一个字母露在外面所以遍历整张图，确定每个边框的范围。 只需确定左上角和右下角... 阅读全文
摘要：
以sample为例子[2,12]区间的RoundNumbers（简称RN）个数:Rn[2,12]=Rn[0,12]-Rn[0,1]即：Rn[start,finish]=Rn[0,finish]-Rn[0,start-1]所以关键是给定一个X，求出Rn[0,X]现在假设X=10100100这个X的二进... 阅读全文
摘要：
The famous Korean internet company nhn has provided an internet-based photo service which allows The famous Korean internet company users to directly ... 阅读全文
摘要：
DescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Ga... 阅读全文
摘要：
http://poj.org/problem?id=2051DescriptionA data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor data, Inter... 阅读全文
摘要：
Team QueueTime Limit:2000MSMemory Limit:65536KTotal Submissions:2471Accepted:926DescriptionQueues and Priority Queues are data structures which are kn... 阅读全文
摘要：
Terrible SetsTime Limit:1000MSMemory Limit:30000KTotal Submissions:3017Accepted:1561DescriptionLet N be the set of all natural numbers {0 , 1 , 2 , . ... 阅读全文
摘要：
DescriptionStandard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features i... 阅读全文
摘要：
DescriptionGiven m sequences, each contains n non-negative integer. Now we may select one number from each sequence to form a sequence with m integers... 阅读全文
摘要：
STL的堆操作STL里面的堆操作一般用到的只有4个:make_heap();、pop_heap();、push_heap();、sort_heap();他们的头文件函数是#include 首先是make_heap();他的函数原型是：void make_heap(first_pointer,end_... 阅读全文