Problem 
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.05.2024 08:55:23 (h2).
Десктопная версия, переключиться на мобильную.
При поддержке
hmmm... i think if you could give us the link to the problems judge, it would've been a lot easier... :)
An efficient way of solving this problem(instead of O(n)). Can you provide the link to the ques so that i can verify my ans?
My Code
Sorry, this problem appears in the OA of ByteDance So, I don't have a link. But Could you PLz Explain your Approach Thanks.
Instead of allocating memory for each second i.e O(n) we can directly make a jump of i seconds. we choose that value of i after which the maxm(m1,m2) changes.
we will remove i' units i.e sum of n natural numbers upto i — (already removed units upto prev. seconds).
i is calculated using quadratic equation i*(i+1)/2=difference reqd.