Hello
Consider Array A. For any suffix of A compute the prefix with maximum average.
Example : A => 1 3 2 5 3
Suffix [2, 5) => 2 5 3
Answer => 3.5
Is there a better solution than O(N ^ 2) ??
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
A Good Problem
Hello
Consider Array A. For any suffix of A compute the prefix with maximum average.
Example : A => 1 3 2 5 3
Suffix [2, 5) => 2 5 3
Answer => 3.5
Is there a better solution than O(N ^ 2) ??
Name |
---|