| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Let's say that we have n Rectangles with known coordinates and m Points with known coordinates.
How to count the number of points that lie inside each Rectangle given that the coordinates are integers (>= 0, <= 106) and n & m <= 106.
Surely, the complexity of O(n*m) is not desirable!
I think of Segment Tree but don't know how and if it's better or not!
May you help me, please?
Is there any advice, materials, or resources on how to enhance the mathematical thinking in kids (e.g. since age 6)?
