I have no idea for this. Can someone help me?
# | 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 |
I have no idea for this. Can someone help me?
Name |
---|
Think about mo's algorithm. The only think left is to find out how to insert and delete a single number, maintaining the number of such pairs. If you don't have any idea look at my code for more information. Code
Can you explain why are you adding like this:
cnt += get(num - k) + get(100000) - get(num + k - 1);
UPD: Ok I understood. SorryWell it is the number of the pairs with the current number, where the absolute difference is at least k. Because such numbers should be smaller or equal than num — k or greater or equal than num + k.