An array is given, and an index present in it.
A window must be chosen such that it includes the index, has this component maximized — sum(a[i]...a[j])*(j-i+1), but less than the threshold.
How we can solve this question optimally?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
3 | adamant | 159 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 150 |
6 | atcoder_official | 148 |
6 | SecondThread | 148 |
8 | nor | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Netflix Onsite Interview Question
An array is given, and an index present in it.
A window must be chosen such that it includes the index, has this component maximized — sum(a[i]...a[j])*(j-i+1), but less than the threshold.
How we can solve this question optimally?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en6 |
![]() |
gXa | 2021-06-28 09:27:17 | 48 | Tiny change: '\nOutput\n~~~~~\nO' -> '\nOutput\n\n~~~~~\nO' | |
en5 |
![]() |
gXa | 2021-06-28 09:25:06 | 98 | ||
en4 |
![]() |
gXa | 2021-06-28 09:16:54 | 130 | ||
en3 |
![]() |
gXa | 2021-06-28 08:51:03 | 39 | ||
en2 |
![]() |
gXa | 2021-06-28 08:50:24 | 22 | Tiny change: 'i+1), but less than' -> 'i+1), but the component must be less than' | |
en1 |
![]() |
gXa | 2021-06-28 08:48:56 | 276 | Initial revision (published) |
Название |
---|