Edward is very sigma and is very popular. For Valentines day, he plans to meet $$$n$$$ new people, each who have a charisma score $$$c_i$$$. These people are standing in a line such that their charisma scores are non-decreasing ($$$c_i \leq c_{i+1}$$$ for all $$$i$$$).
Edward is so sigma and doesn't want to spend too much effort, so he will choose a subsection of people to meet. Here, a subsection is a contiguous range of people from some $$$l$$$ to $$$r$$$. He wants the average charisma of this section to exactly match his own charisma: $$$k$$$.
Please help Edward find the longest subsection that satisfies this. If no such subsection exists, print out $$$0$$$ instead.
The first line contains $$$n$$$, the number of people lining up for Edward, and $$$k$$$, Edward's charisma. $$$1 \leq n \leq 10^5, 1 \leq k \leq 10^5$$$.
The second line contains $$$n$$$ space separated integers, $$$c_1, c_2, ..., c_n$$$, the charisma scores. $$$0 \leq c_i \leq 10^5$$$.
Output one integer, the length of the longest subsection that has average charisma $$$k$$$ (or $$$0$$$ if no such subsection exists).
10 43 4 5 6 7 8 10 10 11 11
3
In the sample testcase, the largest subsection is the first 3 people — $$$3, 4, 5$$$.
