| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
help me this ST problem
sorry for my bad english :<<
Given an array F of size n (n<=1e5) and a fixed k (k<=n-2). Perform the deletion of k elements, then arrange the elements in ascending order, calling W is the greatest minus between two consecutive elements.
Find the smallest W
input
5 1
4 1 2 3 9
output
1
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
duonggsimp | 2024-09-28 12:48:06 | 132 | ||
| en3 |
|
duonggsimp | 2024-09-28 12:19:44 | 26 | Tiny change: ' \n\n1\n\n\nUPDATE: Solution founded' -> ' \n\n1\n\n' | |
| en2 |
|
duonggsimp | 2024-09-28 11:41:36 | 31 | Tiny change: 'tput \n\n1' -> 'tput \n\n1\n\n\nUPDATE: Solution founded' | |
| en1 |
|
duonggsimp | 2024-09-28 10:29:15 | 332 | Initial revision (published) |
