最大投资回报问题:暴力解法 下面的过程遍历的顺序为: 00,(0,1),…,(0,m-1);(1,1),(1,2)…,(1,1-1,….(2m2,、(2,n1,、(1+1) MaxSum=0 for(i=0; i<N; i+ the sequence This Sum=0 for (=i;j<N;j++) ThisSum +=An if(ThisSum > MaxSum) MaxSum= thissum in O(n2) 户=n-1 return MaxSum最大投资回报问题：暴力解法 MaxSum = 0; for (i = 0; i < N; i++) { ThisSum = 0; for (j = i; j < N; j++) { ThisSum += A[j]; if (ThisSum > MaxSum) MaxSum = ThisSum; } } return MaxSum; the sequence i=0 i=1 i=2 i=n-1 j in O(n2 ) 下面的过程遍历的顺序为： (0,0), (0,1), …, (0,n-1); (1,1), (1,2), …, (1,n-1), …… (n-2,n-2), (n-2, n-1), (n-1,n-1)