查看会员资料
用 户 名：yul***
发送消息- Email：用户隐藏
- Icq/MSN：
- 电话号码：
- Homepage：
- 会员简介：
最新会员发布资源
Finding_Maximum
- Finding Maximum Contiguous Subsequence Sum using divide-and-conquer approach-Given a sequence Q of n numbers (positive and negative), the maximum subsequence of Q is the contiguous subsequence that has the maximum sum among all contiguous subsequ