Given 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 sum in this sequence is 6 + (-1) + 5 + 4 = 14.

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1…N. Deleting any node from the tree yields a forest: a collection of one or more trees. Define the balance of a node to be

Dear Contestant,I’m going to have a party at my villa at Hali-Bula to celebrate my retirement from BCM. I wish I could invite all my co-workers, but imagine how an employee can enjoy

Problem DescriptionMy Problem Report这是道非常值得总结的题。通过这道题我对两个概念的理解加深了很多： 无后效性原则 最优子结构 在做动态规划的时候，我们需要明白一点，就是当前状态一定是由过去的状态（也就是最优子结构）转移而来的，而不是说过去的状态影响了现在的状态。我们在对状态进行转移时，要充分意识到三点： 过去的状态一定是最优的，我们

In this task you need to process a set of stock exchange orders and use them to create order book.An order is an instruction of some participant to buy or sell stocks on stock exchange. T

Problem DescriptionLimak is a grizzly bear who desires power and adoration. He wants to win in upcoming elections and rule over the Bearland.There are n candidates, including Limak. We know how many ci

Problem DescritionDo you know a story about the three musketeers? Anyway, you will learn about its origins now.Richelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by hi

Limak is an old brown bear. He often plays poker with his friends. Today they went to a casino. There are n players (including Limak himself) and right now all of them have bids on t

Limak is a little bear who loves to play. Today he is playing by destroying block towers. He built n towers in a row. The i-th tower is made of hi identical blocks.

[UVa1331]Minimax Triangulation

[UVa 1625]Color Length

[UVa10003]Cutting Sticks

[UVa 1626]Brackets sequence

We say a sequence of char- acters is a palindrome if it is the same written forwards and backwards. For example, ‘racecar’ is a palindrome, but ‘fastcar’ is not.

Problem DescriptionYou are given the task to design a lighting system for a huge conference hall. After doing a lot of calculation and sketching, you have figured out the requirements for an energy-eff

到网上参考了很多博客和资料，发现讲得都太复杂。反而是常被吐槽的《算法导论》讲得最清楚、明了。

Problem Description(If you smiled when you see the title, this problem is for you ^_^) For those who don’t know KTV, see: http://en.wikipedia.org/wiki/Karaoke_box There is one very popular song calle

Problem DescriptionProblems that require minimum paths through some domain appear in many different areas of computer science. For example, one of the constraints in VLSI routing problems is minimizing

Let’s play a stone removing game. Initially, n stones are arranged on a circle and numbered 1,…, n clockwise

Problem DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money, John must determine the shortest closed to