Find the length of the longest contiguous segment in an array, in which if a given element K is inserted, K becomes the second largest element of that subarray.(Hard)

Question

1<=A[i]<=1000000

1<=N<=100000

 Eg- {10,1,9,9}

K = 3

Output : 3 , as this subarray : {1,9,9} , when you insert K in it , it becomes the 2nd largest element of this subarray . Also , this was the largest subarray possible .