Help Need for a question.

Правка en1, от peaceful_warrior, 2019-02-28 12:05:39

So you have an array A of size N. Let's say 10 20 40 80 10 What we have to do it divide the array into two subSequence such that. The difference between the absolute value of first and second is minimum. in the above case, the answer would. first subSequence 10, 10 = 0 second 20 40 80. = (20 + 40) = 60

can anyone help?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский peaceful_warrior 2019-02-28 12:05:39 357 Initial revision (published)