subrat0018's blog

By subrat0018, history, 15 months ago, In English

I came across an interesting problem while giving Junglee CodeFest at HackerEarth. I could not solve the problem in the contest. Is anyone up with any approach?

Given an array arr of N integers. Each array has some hardness

hardness = max abs(arr[i+1]-arr[i]) for all 1<=i<=N-1

And hardness = 0 if N<=1

You are given a number K you can change at most K elements of the array. You have to minimize the hardness of the array

Both N and K were less than 2000

Array elements are less than 1e9

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
15 months ago, # |
  Vote: I like it +10 Vote: I do not like it

Give the problem's link

  • »
    »
    15 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Since it was a hiring contest. So the problem link is not public.

»
15 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it
Probably full solution