| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 151 |
How to solve this?
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?
Eg: Array = [1,1,1,2,2,1]
Answer = 20
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
