Need help in a problem

Revision en1, by subrat0018, 2023-07-26 09:44:05

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

Tags need help

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English subrat0018 2023-07-26 09:44:05 550 Initial revision (published)