PROBLEM LINK:Author: Dmytro Berezin DIFFICULTY:Cakewalk PREREQUISITES:Programming PROBLEM:Given a sequence of numbers W[0..N1], find out a number S, such that S  i >= W[i] holds for all 0 <= i < N. EXPLANATION:It is easy to find out the choice of decreasing speed is to decrease it by 1 after each segment. So we can have the above problem. After some transformations, the requirement is that S >= W[i] + i holds for all 0 <= i < N. Therefore, simply let S be the maximum of W[i]+i is the best choice. AUTHOR'S AND TESTER'S SOLUTIONS:Author's solution can be found here.
This question is marked "community wiki".
asked 18 Mar '14, 20:29

@gursheel07 Initially I too thought it should be max(W[i])+i but that is not correct, take an example W[] = 4, 2, 1, 2 according to your approach answer should be 4, but then when chef reaches the last segment speed will be 1, which is less than 2, therefore it is not correct. The required speed for last segment is 2, hence answer would be 5. So you have to consider max(W[i]+i)
link
This answer is marked "community wiki".
answered 04 Dec '14, 21:23

Shouldn't it be max(W[i])+i instead of max(W[i]+i)? My answer is wrong but I couldn't understand why it should be max(W[i]+i).