Hi everyone,Here is the link to the problem here .I got the general O(n*n) approach but It will TLE obviously .When I googled the problem,I got Chinese editorials regarding the same and they all pointed to involvement of segment trees.I could not get much details due to lack of clearity in the English text produced by the Translator .Can someone please help me regarding the same .Thanks and have a nice day :)
Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
→ Pay attention
→ Streams
→ Top rated
| # | 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | SecondThread | 148 |
| 5 | atcoder_official | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
→ Find user
→ Recent actions
An Interesting POJ Problem — 2828 Buy Tickets
Revision en1, by ILovePlumCakeAndIceCream, 2017-02-05 20:45:24
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
ILovePlumCakeAndIceCream | 2017-02-05 20:45:24 | 491 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Jul/22/2024 20:23:53 (k3).
Desktop version, switch to mobile version.
Supported by
