17057번 - Alice in the Digital World 다국어

After returning from the Wonderland, Alice needs to improve her scientific skills in this current digital world. Alice decides to participate the ACM-ICPC Asia Nha Trang Regional Contest 2016 to evaluate her actual performance. Her most favorite problem in the contest is following.

Given an array of positive integers A = a₁, a₂,…, a_n, a subarray A_i,j of A is a sequence of
continuous elements in A, i.e., A_i,j = a_i, a_i+1,…, a_j (where 1 ≤ i ≤ j ≤ n). The weight of Ai,j is the sum of all its elements,

Given an integer m, your task is to find the maximum weight subarray of \(A\) that contains only one m as the minimum element. You can assume that A always contains at least one element with value m.

The input consists of several datasets. The first line of the input contains the number of datasets, which is a positive number and is not greater than 20. The following lines describe the datasets.

Each dataset is described by the following lines:

• The first line contains 2 positive integers n and m (n ≤ 10⁵; m ≤ 2⁶).
• The second line contains n positive integers, each with value at most 2⁶.

For each dataset, write out on one line the found maximum weight.