HDU
文章平均质量分 82
ACM_Frank
这个作者很懒,什么都没留下…
展开
-
hdu 1231 最大连续子序列
Description 给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ..., Nj },其中 1 例如给定序列{ -2, 11, -4, 13, -5, -2 },其最大连续子序列为{ 11, -4, 13 },最大和 为20。 在今年的数据结构考卷中,要求编写程序得到最大和,现在增加一个要求,即还需要输出该原创 2016-09-07 15:41:48 · 833 阅读 · 0 评论 -
HDU-5933 ArcSoft's Office Rearrangement
Problem Description ArcSoft, Inc. is a leading global professional computer photography and computer vision technology company. There are N working blocks in ArcSoft company, which form a stra原创 2016-11-21 22:33:45 · 430 阅读 · 0 评论 -
HDU-1003 Max Sum
Given a sequence a11,a22,a33......ann, 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. InputThe原创 2017-03-19 08:30:31 · 410 阅读 · 0 评论