### wh1te_whale's blog

By wh1te_whale, history, 11 months ago, ,

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.

• +17

 » 11 months ago, # | ← Rev. 2 →   0 What are the constraints? Time Limit etc. ? Max.Size of array?
 » 11 months ago, # |   +3 I think it is similar to 1132F - Clear the String
•  » » 11 months ago, # ^ |   +1 You have to find order of those operations also to get solution of this problem.
•  » » » 11 months ago, # ^ |   -8 But he hasn't said this in the blog. How do you know. Are you both related
•  » » » » 11 months ago, # ^ |   0 Score will change on the basis of order.11212say it divided into 4 segments 11,2,1,2If 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.
•  » » » » » 11 months ago, # ^ |   0 Oh Probably I misunderstood your statement. Sorry for that
•  » » » » 11 months ago, # ^ |   0 amitgomi explaied it right.
 » 11 months ago, # |   0 Auto comment: topic has been updated by wh1te_whale (previous revision, new revision, compare).