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.
# | User | Rating |
---|---|---|
1 | jiangly | 4039 |
2 | tourist | 3841 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3590 |
5 | ecnerwala | 3542 |
6 | Benq | 3535 |
7 | orzdevinwang | 3526 |
8 | gamegame | 3477 |
9 | heuristica | 3357 |
10 | Radewoosh | 3355 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | atcoder_official | 160 |
3 | Um_nik | 160 |
5 | djm03178 | 157 |
6 | Dominater069 | 156 |
7 | adamant | 153 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 147 |
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.
Name |
---|
You are asking this question from a recent test. Is the test over?