I am trying to solve the following problem, but I don't know how to begin, Any hint/approach is appreciated
№ | Пользователь | Рейтинг |
---|---|---|
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 | maomao90 | 167 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
I am trying to solve the following problem, but I don't know how to begin, Any hint/approach is appreciated
Название |
---|
$$$\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$$$.
Thanks man, I will try this approach.
Represent the summation in a simpler way and then it should become trivial.