You are given n checkpoints in (x , y) plane . you have to choose any two pairs i , j (j can be = i ) such that (xj-xi) + (yj-yi) = k
How to solve it in O(n) time .
N = 1e5 .
xi, yi = -1e9 , 1e9
Any idea.
# | User | Rating |
---|---|---|
1 | tourist | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 156 |
5 | nor | 153 |
6 | maroonrk | 152 |
6 | -is-this-fft- | 152 |
8 | Petr | 145 |
9 | orz | 144 |
9 | pajenegod | 144 |
N checkpoint problem.
You are given n checkpoints in (x , y) plane . you have to choose any two pairs i , j (j can be = i ) such that (xj-xi) + (yj-yi) = k
How to solve it in O(n) time .
N = 1e5 .
xi, yi = -1e9 , 1e9
Any idea.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en3 |
![]() |
atlasworld | 2019-02-24 00:10:18 | 8 | ||
en2 |
![]() |
atlasworld | 2019-02-24 00:09:49 | 174 | ||
en1 |
![]() |
atlasworld | 2019-02-24 00:06:40 | 238 | Initial revision (published) |
Name |
---|