How to solve this?

Правка en4, от wh1te_whale, 2019-07-18 11:39:56

Given an array of n integer elements. At a single moment we can delete a subarray if every element of this subarray is equal to one another. Doing so give us the points equal to (size of subarray)^2. We have to completely eliminate the array and also maximise the sum of points scored. How to solve this problem?

Score will change on the basis of order.

Eg:

Array = 11212

say it divided into 4 segments 11,2,1,2

If you choose order of segments as 3,(2,4),1. then score will be 1+4+4.

If you choose order of segments as 2,4,(1,3). then score will be 1+1+9.

amitgomi thanks for this example.

Теги #array, #subarray, maximise

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский wh1te_whale 2019-07-18 11:39:56 283
en3 Английский wh1te_whale 2019-07-18 08:42:38 7 Tiny change: 'imise the points sc' -> 'imise the sum of points sc'
en2 Английский wh1te_whale 2019-07-18 08:42:11 45 Tiny change: 's problem?' -> 's problem?\n\nEg:\nArray = [1,1,1,2,2,1]\nAnswer = 20'
en1 Английский wh1te_whale 2019-07-17 18:16:30 327 Initial revision (published)