Interesting and hard OA quesn

Revision en1, by Titan_2003, 2024-07-31 21:43:42

Problem: Minimum Sum of Absolute Differences in Subsequences

Description:

Given an array of length N (where 1≤N≤1e5) and an integer k (where 1≤k≤50), find the minimum possible value of the sum of absolute differences of adjacent elements for all subsequences of length k.

Mathematically, for a subsequence {ai1,ai2,…,aik} where i1<i2<…<iki1​<i2​<…<ik​, we need to minimize the value of:

$$$\sum_{j=1}^k |a_{i} - a_{i-1}|$$$

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Titan_2003 2024-07-31 21:43:42 464 Initial revision (published)