I am trying to solve the following problem, but I don't know how to begin, Any hint/approach is appreciated
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
I am trying to solve the following problem, but I don't know how to begin, Any hint/approach is appreciated
Name |
---|
$$$\sum_{j=L}^{R} \sum_{k=j+1}^{R}(A_j*A_k)=((\sum_{j=L}^{R} A_j)^2-\sum_{j=L}^{R}A_j^2)/2$$$, so you can maintain two segment trees, one for $$$(\sum_{j=L}^{R} A_j)^2$$$, and the second for $$$\sum_{j=L}^{R}A_j^2$$$. To update first segment tree, you will need to maintain $$$\sum_{j=L}^{R} A_j$$$.
Represent the summation in a simpler way and then it should become trivial.