Maximize Followers

Problem Statement

Maximize Followers Problem Description N people stand in a row. Person i initially holds money[i] dollars. Bob holds a fixed amount K . Every person whose money is exactly equal to K is a follower of Bob. You may perform the following operation at most once : Choose a block of consecutive people L, R with 0 ≤ L ≤ R ≤ N - 1 , and choose an integer X . Add X to every person in that block, i.e. money[j] = money[j] + X for every j with L ≤ j ≤ R . A negative X means you take money from each of those people. Return the maximum number of followers Bob can have after the operation. Input The function takes three parameters: N : the number of people. K : Bob's amount. money[] : the initial money of each person. For custom testing, standard input has three lines: The first line contains N . The second line contains K . The third line contains the N integers of money[] , separated by spaces. Output Print a single integer: the maximum number of people whose money equals K after at