摘要: 又是一次的毕业季,羡慕嫉妒啊....二叉查找树类的框架: 1 template <typename Comparable> 2 class BinarySearchTree 3 { 4 public: 5 BinarySearchTree(); 6 BinarySearchTree(const BinarySearchTree & rhs) 7 ~BinarySearchTree(); 8 9 const Comparable & findMin() const;10 const Comparable & findMax() const;11 12 ... 阅读全文
posted @ 2012-09-19 20:35 xingoo 阅读(370) 评论(0) 推荐(0) 编辑
摘要: Let the Balloon RiseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 45024Accepted Submission(s): 15983Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time 阅读全文
posted @ 2012-09-19 15:33 xingoo 阅读(520) 评论(0) 推荐(0) 编辑
摘要: Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 85953Accepted Submission(s): 19912Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max 阅读全文
posted @ 2012-09-19 15:32 xingoo 阅读(529) 评论(0) 推荐(0) 编辑
摘要: A + B Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 124589Accepted Submission(s): 23993Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.InputThe first line of 阅读全文
posted @ 2012-09-19 15:31 xingoo 阅读(317) 评论(0) 推荐(0) 编辑
摘要: 那一年我们研一,面对本科那些孩子们突然感觉自己已经很老了,却还在犯着很幼稚的错误。那一年我们研一,却发现曾经挑灯夜读为之奋斗的梦在慢慢破灭,这不是我们想要的生活。那一年我们研一,整天顶着高学历的帽子招摇过市的我们其实知道的真的很少。那一年我们研一,本科时得过且过的心态还未散尽却发现其实毕业离我们真的不远了。那一年我们研一,看多了身边太多的合合分分,不再相信感情的坚实,却依然带着几分希冀期盼着什么… …那一年我们研一,偶尔看到大一大二的孩子们,突然感觉他们好小啊,也默默地想像着:如果再来一次我的大学会怎么过呢?但最后还是苦笑了一下继续自己纠结的课题。那一年我们研一,突然怀念本科老师能把一个个知识 阅读全文
posted @ 2012-09-19 15:22 xingoo 阅读(707) 评论(2) 推荐(5) 编辑