Time Limit:2000MS Memory Limit:65536KBDescriptionA data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor dat...
Time Limit:1000MS Memory Limit:32768KBDescription?A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod...
Time Limit:1000MS Memory Limit:32768KBDescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the ...
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4989题目意思：给出 n 个数，然后将这些数两两相加，得到 n*(n-1) /2 对和，把重复的和去掉，最后相加起来。 用STL中的set可以好方便的做出来，因为 insert 的时候它会自动去除重复的....
分类：
其他好文 时间：
2015-02-24 11:23:30
阅读次数：
182
Time Limit:1000MSMemory Limit:32768KBDescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For...
Time Limit:1000MSMemory Limit:32768KBDescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of ...
Time Limit:1000MSMemory Limit:32768KBDescriptionCalculate A + B.InputEach line will contain two integers A and B. Process to end of file.OutputFor eac...
Time Limit:500MSMemory Limit:32768KBDescription?Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, yourtask is to calculat...
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1556题目意思：有 n 个气球从左到右排成一排，编号依次为1,2,3,...,n。给出 n 对 a, b，表示编号为 a ~b 的气球被涂过一次色。n 次之后，问所有气球被上色的次数分别是多少。 典型的....
分类：
其他好文 时间：
2015-02-23 15:28:02
阅读次数：
103
【题目】Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack.pop() -- Rem...
分类：
其他好文 时间：
2015-02-19 17:29:31
阅读次数：
263
