| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 161 |
| 2 | maomao90 | 160 |
| 2 | Um_nik | 160 |
| 4 | awoo | 159 |
| 5 | atcoder_official | 157 |
| 6 | -is-this-fft- | 156 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 148 |
I think my solution has a time complexity of O(nlogn) as I am doing binary search on answer but it still gives TLE, why is it giving TLE . This is the problem link:- https://codeforces.net/contest/126/problem/B
This is my solution:- https://codeforces.net/contest/126/submission/271378723
Please help in this
The function f works in "n square" complexity in the worst case for comparing deque again and again.
Thanks, overlooked it, I think it will need to be solved using KMP then.