| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
+30
Thank you for taking the time to write this so nicely. |
|
0
c[i] must be greater than b[i], because ai or ak >= ai and ak. Using d[i] you lose this property. If you swap b[i] and c[i] for a problem with solution you would obtain a problem without solution but same array d. |
|
0
Think some more. |
|
+3
I think materials are available here: https://github.com/gabrielrcp/Treino-Maratona/tree/master/verao2010/ |
|
0
Your code is wrong. Answer can only be 9. |
|
0
My submission, which got AC, gives 9 as an answer. On the 8th day there hasn't been a chance to pass exam 2 so the answer is at least 9. |
|
+3
This problem can be solved by backtracking. |
| Name |
|---|


