№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Название |
---|
This is much better than usual Editorials
Please keep doing this.
Where is the channel link or tell me the channel name
@T_tasir he provided the video links in the blog you can just check it from there.
Anyways, the channel name is "Stefan Dascalescu" and click here to go to his channel.
Can anyone explain why O(n^2) would not work for div 2 B?
Look at the constraints of n it will go (200000)^2 =>4 x 10^10 cf compiler can execute only approx. 10^8 operations per second so it will give TLE.
Thanks for these video editorials