
动态规划
研发之道
一个坚持把架构做到极致的技术人,热衷于互联网技术。混迹互联网十几年,热衷于高性能、高并发、分布式技术领域的研究。
展开
-
最长的单调自增子序列(不一定连续)和
问题:给定一个长度为N的数组,找出一个最长的单调自增子序列(不一定连续),如序列 1,-1,2,-3,4,-5,6,-7的最长递增子序列长度为4(1,2,4,6) 方法一: 最笨算法,复杂度为O(n*n),设一个辅助数组用来记录以对应元素结尾的最大递增子序列的长度(即lis[i]表示 以array[i]结尾的最大递增子序列长度为lis[i]),从头到尾扫一遍原数组,对于每个元素转载 2015-03-22 00:56:13 · 1989 阅读 · 0 评论 -
杭电 HDU ACM 1087 Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 25410 Accepted Submission(s): 11226 Problem Descript原创 2015-04-14 16:47:24 · 1010 阅读 · 0 评论 -
杭电 HDU ACM 1025 Constructing Roads In JGShining's Kingdom
Constructing Roads In JGShining's Kingdom Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17732 Accepted Submission(s): 5023 Problem原创 2015-04-17 01:40:19 · 993 阅读 · 0 评论 -
杭电 HDU ACM 1159 Common Subsequence
Common Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 26493 Accepted Submission(s): 11771 Problem Description A subsequ原创 2015-04-30 16:53:53 · 1092 阅读 · 0 评论 -
杭电 HDU ACM 1421 搬寝室
搬寝室 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 19784 Accepted Submission(s): 6719 Problem Description 搬寝室是很累的,xhd深有体会.时间追述2006年原创 2015-04-30 21:40:43 · 1045 阅读 · 0 评论