- 博客(2)
- 资源 (2)
- 收藏
- 关注
RSS订阅原创 02-线性结构4 Pop Sequence (25分)
02-线性结构4 Pop Sequence (25分) Given a stack which can keep MM numbers at most. Push NN numbers in the order of 1, 2, 3, …, NN and pop randomly. You are supposed to tell if a given sequence of numbers
2017-04-15 22:28:26
536
原创 Maximum Subsequence Sum
复杂度2 Maximum Subsequence Sum (25分) Given a sequence of KK integers { N_1N 1 , N_2N 2 , …, N_KN K }. A continuous subsequence is defined to be { N_iN i , N_{i+1}N i+1 ,
2017-04-15 00:27:52
424
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人