How to think about to write code of finding the longest subsequencearray with sum greater than or equal to k in O(nlogn).
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3751 |
| 2 | Benq | 3727 |
| 3 | cnnfls_csy | 3691 |
| 4 | Radewoosh | 3651 |
| 5 | jiangly | 3632 |
| 6 | orzdevinwang | 3559 |
| 7 | -0.5 | 3545 |
| 8 | inaFSTream | 3478 |
| 9 | fantasy | 3468 |
| 10 | Rebelz | 3415 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | adamant | 178 |
| 2 | awoo | 167 |
| 3 | BledDest | 165 |
| 4 | Um_nik | 164 |
| 5 | maroonrk | 163 |
| 6 | SecondThread | 160 |
| 7 | nor | 158 |
| 8 | -is-this-fft- | 154 |
| 9 | kostka | 146 |
| 10 | TheScrasse | 144 |
→ Find user
→ Recent actions
Can anyone help me in sorting this question.
Difference between en1 and en2,
changed 13 character(s)
History
Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/28/2023 23:04:47 (l1).
Desktop version, switch to mobile version.
Supported by
