2015年8月11日
最大子段和
摘要： 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 ma... 阅读全文
posted @ 2015-08-11 09:04 果冻0_0 阅读(156) 评论(0) 推荐(0)
HDU 1052
摘要： DescriptionHere is a famous story in Chinese history."That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes t... 阅读全文
posted @ 2015-08-11 08:51 果冻0_0 阅读(268) 评论(0) 推荐(0)