Kadane's Algorithm

Medium Algorithmic Challenges

Solve in Playground →

Problem Statement

Write a C program to find the contiguous subarray within a one-dimensional array of numbers which has the largest sum (Maximum Subarray Sum).

Input Format

First line contains N. Second line contains N space-separated integers.

Output Format

Print the maximum subarray sum.

Constraints

1 <= N <= 1000

Sample Input

8
-2 1 -3 4 -1 2 1 -5 4

Sample Output

Explanation

Subarray [4, -1, 2, 1] has the largest sum 6.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        int arr[n];
        for (int i = 0; i < n; i++) scanf("%d", &arr[i]);
        // Write your code here
    }
    return 0;
}

Limits

Time Limit: 1s
Memory Limit: 256MB

Start Coding in IDE →