Untitled

 avatar
unknown
plain_text
2 years ago
941 B
3
Indexable
#include <iostream>
using namespace std;

void maxSubArray(int arr[], int n) {
    int max_sum = INT_MIN, curr_sum;
    int start_index = 0, end_index = 0;

    for (int i = 0; i < n; i++) {
        curr_sum = 0;

        for (int j = i; j < n; j++) {
            curr_sum += arr[j];

            if (curr_sum > max_sum) {
                max_sum = curr_sum;
                start_index = i;
                end_index = j;
            }
        }
    }

    cout << "Maximum sum subarray: ";
    for (int i = start_index; i <= end_index; i++) {
        cout << arr[i] << " ";
    }
    cout << endl;

    cout << "Starting index: " << start_index << endl;
    cout << "Ending index: " << end_index << endl;
    cout << "Maximum sum: " << max_sum << endl;
}

int main() {
    int arr[] = {13, -3, -25, 20, -3, 16, -23, 18, 20, -7, 12, -5, 22, 15, -4, 7};
    int n = sizeof(arr)/sizeof(arr[0]);
    
    maxSubArray(arr, n);

    return 0;
}
Editor is loading...