Max Incremental Gain in Segments

Given an array of integers that represent profits/losses over a series of days, write a program to find the maximum profit that can be earned by incrementally including days based on a starting index. You may skip days, but once you include a day in a segment, you must include all subsequent days until a total profit is calculated. Input format: - The first line contains an integer n (number of days). - The second line contains n space-separated integers, representing the profit/loss for each day. Output format: - Print the maximum profit obtainable from any starting day. Example: Input: 5 1 -2 3 -1 2 Output: 5