| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | maomao90 | 163 |
| 2 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 160 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
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) |
