HDU 1231 最大连续子序列 动态规划
摘要:
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1231最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14593Accepted Submission(s): 6377Problem Description给定K个整数的序列{ N1, N2, ..., NK },其任意连续子序列可表示为{ Ni, Ni+1, ...,Nj },其中 1 <= i <= j <= K 阅读全文
posted @ 2013-05-19 23:05 圣手摘星 阅读(160) 评论(0) 推荐(0) 编辑