Can anybody tell me how to solve Atcoder question Equal cut. The question is Cut the array at 3 positions such that difference of maximum sum of any one part and minimum sum of another part is minimum?
Equal Cut Atcoder
Can anybody tell me how to solve Atcoder question Equal cut. The question is Cut the array at 3 positions such that difference of maximum sum of any one part and minimum sum of another part is minimum?
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | -is-this-fft- | 161 |
| 3 | Dominater069 | 160 |
| 3 | Qingyu | 160 |
| 5 | atcoder_official | 158 |
| 6 | adamant | 155 |
| 7 | Um_nik | 152 |
| 8 | djm03178 | 151 |
| 8 | luogu_official | 151 |
| 10 | awoo | 148 |
