CF722C Destroying Array

You are given an array consisting of $ n $ non-negative integers $ a_{1},a_{2},...,a_{n} $ . You are going to destroy integers in the array one by one. Thus, you are given the permutation of integers from $ 1 $ to $ n $ defining the order elements of the array are destroyed. After each element is destroyed you have to find out the segment of the array, such that it contains no destroyed elements and the sum of its elements is maximum possible. The sum of elements in the empty segment is considered to be $ 0 $ .

N/A

N/A

Consider the first sample: 1. Third element is destroyed. Array is now $ 1 3 * 5 $ . Segment with maximum sum $ 5 $ consists of one integer $ 5 $ . 2. Fourth element is destroyed. Array is now $ 1 3 * * $ . Segment with maximum sum $ 4 $ consists of two integers $ 1 3 $ . 3. First element is destroyed. Array is now $ * 3 * * $ . Segment with maximum sum $ 3 $ consists of one integer $ 3 $ . 4. Last element is destroyed. At this moment there are no valid nonempty segments left in this array, so the answer is equal to $ 0 $ .