题目Max Sum 题面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,

题目题面Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每

题目题面You want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers, each being

题目题面Maximum sumTime Limit: 1000MSMemory Limit: 65536KDescription Given a set of n integers: A={a1, a2,…, an}, we de

题目题面Cards Sorting Vasily has a deck of cards consisting of n cards.There is an integer on each of the cards, this intege

题目题面You are given an array a1,a2,…,an and two integers m and k. You can choose some subarray al,al+1,…,ar−1,ar. The cost

题目题面Alice and Bob love playing one-dimensional battle ships. They play on the field in the form of a line consisting of