Given an array of N numbers and a number K find the maximum subarray size such that the average of the elements of the subarray >= k
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
How to solve this problem?
Given an array of N numbers and a number K find the maximum subarray size such that the average of the elements of the subarray >= k
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 | rahul_bhaiya_sabka_baap | 2018-08-01 20:55:59 | 0 | (published) | ||
en2 | rahul_bhaiya_sabka_baap | 2018-08-01 20:41:35 | 6 | Tiny change: 'find the minimum sunarray size' -> 'find the maximum subarray size' (saved to drafts) | ||
en1 | rahul_bhaiya_sabka_baap | 2018-08-01 20:40:32 | 158 | Initial revision (published) |
Name |
---|