classSolution {public:intmaxSubArray(intA[],intn) {//dp[i + 1] = max(dp[i] + A[i], A[i]);//int start = 0, end = 0;intmax = A[0];intsum = A[0];for(inti =1; i < n; i++) {if(A[i] >(sum +A[i])) { sum=A[i];//if (sum > max) start = i;}else{ ...