连续子数组的最大和并返回下标
动态规划sum= max(sum+dp[i],dp[i])max = max(sum,max)public static int FindGreatestSumOfSubArray(int[] array) { int sum = 0;//包含a[i int max = 0;//不包括 int begin = 0; int end = 0; // 动态规划 sum= max = for(int i =