Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Kadane, Minus One

Kadane, Minus One

Difficulty: 1600 4000 ms 128 MB

dp

Find the maximum sum of a non-empty contiguous subarray, where you may optionally delete AT MOST ONE element from within it (the remaining elements must stay contiguous in the original array).

Input: the first line has N; the second line has N integers.

Output: the best achievable sum.

Constraints:

  • 1 ≤ N ≤ 105
  • |ai| ≤ 104

Sample Tests

Input 1
5
1 -2 3 -1 4
Output 1
7
Input 2
1
-3
Output 2
-3

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen