How to solve this?

Revision en1, by wh1te_whale, 2019-07-17 18:16:30

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 points scored. How to solve this problem?

Tags #array, #subarray, maximise

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English wh1te_whale 2019-07-18 11:39:56 283
en3 English wh1te_whale 2019-07-18 08:42:38 7 Tiny change: 'imise the points sc' -> 'imise the sum of points sc'
en2 English 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 English wh1te_whale 2019-07-17 18:16:30 327 Initial revision (published)