Банальная задача: Дано n точек на плоскости. Необходимо найти наибольшее количество точек, лежащих на одной прямой.
Вопрос: Решаема ли эта задача быстрее, чем за 
, или же О(n2) — с хеш-мэпом.
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
5 days
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
5 days
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 173 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 160 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | pajenegod | 145 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/21/2024 05:02:33 (l3).
Desktop version, switch to mobile version.
Supported by
There is problem called 3SUM, for which there are no known subquadratic (o(n2)) algorithms in common case. Many geometric problems are proven to be 3SUM-Hard, including "Given n points, check if there are 3 collinear points". Some more information in this paper.