Design an earliest longest-plateau report

Original practice scenario: a sensor logs at most twelve integer readings. A plateau is a maximal consecutive run of equal values. Design and write a function that reports the start index, length and value of the longest plateau; break length ties by earliest start. Preserve the input array. Use a three-int result array and return length zero for an empty log. Write a full program reading 0<=n<=12 and n values in [-100,100]. Print EMPTY when n=0; otherwise print start=S length=L value=V. Explain how your algorithm closes the final plateau without reading a[n]. The tie sample is 8 / 5 5 2 2 9 9 9 1.


