Hello. I recently met this problem but can't solve it, please help me solve it.

Given an array of n integers. There are q queries. Each query gives us a subarray from l to r. Find the maximum occurrence of a number in the subarray.

(Sorry for my bad English :) )