| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
|
+6
This not a discussion group, this a group where they will give out solutions for payment. |
|
0
Much appreciated! |
|
0
What helps me solve questions like B is going through the testcases. We have an operation and we need to figure out when should we use that operation. One question I got while going through testcases was: Suppose you have 4 1's: 1 1 1 1, should I leave it as is, as it is balanced or should I increase two of 1's to 2's: 1 1 2 2? The following sample testcase made me realize it is always best to increase whenever possible as the incremented nos. might help in the future. 8 1 1 1 1 1 1 1 4 |
|
+8
I have personally learned all these topics from the Competitive Programmer's Handbook and parallelly solved the questions on the cses problemset. I would recommend these for you as well. |
|
0
Congratulations and all the very best! |
|
+2
Removing the highest degree node greedily won't always work. Suppose: Tree: 1-3-2-4-5. Here nodes 2,3 & 4 have degree 2. But here we have to remove node 3 & 4 to get the maximum. |
|
+3
|
