Print all pairs in an array whose sum equals a given number.

Difficulty: Hard

Phase: 6 · Mixed Logical Challenges

XP Reward: 30 XP

Topics: Mixed Logical Challenges, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given N followed by N integers, find the maximum contiguous subarray sum (Kadane's algorithm). Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

-10^9 <= N <= 10^9

Examples

Example 1

Input: 8 -2 -3 4 -1 -2 1 5 -3

Output: 7

Explanation: Sample execution for input 8 -2 -3 4 -1 -2 1 5 -3