Given an array how to find sum of all f(A',k) where A' is subarray of A and f(A',k) are total unordered pairs (i,j) such that abs(A[i]−A[j])>=k.How to solve this using segment tree.What should be the merge function?
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 162 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
March Easy problem:
Given an array how to find sum of all f(A',k) where A' is subarray of A and f(A',k) are total unordered pairs (i,j) such that abs(A[i]−A[j])>=k.How to solve this using segment tree.What should be the merge function?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | kabirsahni8 | 2017-03-02 01:04:55 | 229 | |||
en1 | kabirsahni8 | 2017-03-02 00:56:48 | 236 | Initial revision (published) |
Name |
---|