yes

100. Detective's Mood

Time Limit: 1 seconds

Memory Limit: 256 MB

Rating: 1200

The stress of the case is taking a toll. Each day, your mood fluctuates wildly. Some days are great, and others are filled with despair. Track the longest streak of "good mood days" to determine when you're most effective. Input is denoted by a list of $N$ integers $nums_i$. Each integer represents your mood score for a particular day: positive values are good days, and negative values are bad days. Your task is to find the maximum sum of a contiguous subarray (a sequence of consecutive days). For example, given $nums = [-2, 1, -3, 4, -1, 2, 1, -5, 4]$, the maximum sum is $6$ for the subarray $[4, -1, 2, 1]$.

You are given an integer $N$ on the first line, followed by $N$ space-separated integers that form the array $nums$.

Output the maximum sum of a contiguous subarray taken from $nums$. $1 \le N \le 10{,}000$

Sample Input 1:
9
-2 1 -3 4 -1 2 1 -5 4

Sample Output 1:
6

An explanation is already given in the problem statement.

KL Coding Cup March 2025 > Speed Round > Problem 5