随笔分类 -  PTA-数据结构

01-复杂度2 Maximum Subsequence Sum (25分)
摘要：#include void MaxSubsseqSum1(int A[], int N) { int ThisSum = 0, MaxSum = -1; int start,end; int temp = 0; for (int i = 0; iMaxSum){ ... 阅读全文
posted @ 2015-09-04 15:57 sjDeak 阅读(289) 评论(0) 推荐(0)