| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
A not so easy problem on Set of Numbers
Hi
I frequently think of problems on my own, and try to solve them.
But this simple problem got me dazzled!
You have a set A, size N, Ai upto 109.
You play N - 1 steps on it.
Each step, pick any 2 elements x, y and remove both of them. Add back abs(x - y) to A.
Print the max value possible at end.
I was thinking that DP might solve this, but I was wrong about the approach that was coming to my mind.
Happy Coding!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
rachitiitr | 2018-02-10 13:06:00 | 31 | Tiny change: 'ong :) \n\nH' -> 'ong :) \n\nCan anyone solve this? \n\nH' | |
| en3 |
|
rachitiitr | 2018-02-09 22:01:19 | 2 | Tiny change: 'h:** \n\nThe ans ' -> 'h:** \nThe ans ' | |
| en2 |
|
rachitiitr | 2018-02-09 22:01:03 | 283 | ||
| en1 |
|
rachitiitr | 2018-02-09 21:58:25 | 526 | Initial revision (published) |
