I thought of a solution but I have a doubt if my solution will work.
Please tell your solution of solving it, also a little analysis of the time complexity(if you have time)
Here is the problem: Click Me
№ | Пользователь | Рейтинг |
---|---|---|
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 | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
Please help in this interview problem
I thought of a solution but I have a doubt if my solution will work.
Please tell your solution of solving it, also a little analysis of the time complexity(if you have time)
Here is the problem: Click Me
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en4 | saint_coder | 2019-06-19 11:27:07 | 2 | Tiny change: 'straints\n1<=N<=20' -> 'straints\n\n1<=N<=20' | ||
en3 | saint_coder | 2019-06-19 11:22:41 | 770 | Tiny change: '=N<=2000\n1<=A[i],' -> '=N<=2000\n\n1<=A[i],' | ||
en2 | saint_coder | 2019-06-19 09:32:49 | 66 | |||
en1 | saint_coder | 2019-06-19 09:31:10 | 268 | Initial revision (published) |
Название |
---|