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
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 151 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
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) |
Name |
---|