Problem Statement  
You are given a String[] initialArray. Concatenate the elements of initialArray to obtain a single space separated list of nonnegative integers. Call this array A. You are allowed to perform operations of the following type on A. Choose two zerobased indices i and j such that 0 <= i <= j < n, where n is the number of elements in A. For each k between i and j, inclusive, if A[k] is greater than 0, decrease A[k] by 1. The cost of such an operation is j  i + 1. You are allowed to perform at most K operations. The total cost of all these operations must be less than or equal to M. Your goal is to end up with an array where the largest value is as small as possible. Return the largest value in this final array.  
Definition  
 
Constraints  
  initialArray will contain between 1 and 50 elements, inclusive.  
  Each element of initialArray will contain between 1 and 50 characters, inclusive.  
  initialArray will contain only spaces and digits ('0''9').  
  The elements of initialArray, when concatenated together, will contain a spaceseparated list of values. Let us call the concatenated string A.  
  A will contain no leading, trailing, or consecutive spaces.  
  A will contain between 1 and 250 values, inclusive.  
  Each value in A will be an integer between 0 and 2,000,000, inclusive, with no extra leading zeroes.  
  K will be between 1 and 500,000,000, inclusive.  
  M will be between 1 and 500,000,000, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
