I have been trying to solve the following spoj problem for quite a few days but hasn't been able to come up with a solution. The link to the problem is http://www.spoj.com/problems/HALCAND/. Even a slightest of help will be highly appreciated. Thanks in advance.

Given an array of n elements. ‘n’ operations needs to be performed on the array. For each operation start_index, end_index,trim_value is given. One has trim the value starting from the start_index to end_index inclusive. If the value at that index is more than or equal to trim value then make it equal to trim_value else leave it as it is. After performing ‘n’ operations find the maximum value of the array.