Hi all, The problem was to find a subarray within an array such that the sum of subarray*minimum of the subarray is maximum in an array of integers. Thanks in advance to anyone who can help me with the approach.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 165 |
2 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
4 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
Help needed for a problem
Hi all, The problem was to find a subarray within an array such that the sum of subarray*minimum of the subarray is maximum in an array of integers. Thanks in advance to anyone who can help me with the approach.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | Cment__Mixer | 2021-03-06 22:09:09 | 238 | Initial revision (published) |
Название |
---|