| # | 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 | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Help needed in optimising this problem
Hey all, Hope you are doing great. Recently, I started with Dynamic programming but got stuck in the Problem called "TETRAHEDRON":
Link for the Problem: https://mirror.codeforces.com/contest/166/problem/E
I tried my best but was not able to get rid of the Memory limit exceed. Here is my Solution: https://mirror.codeforces.com/contest/166/submission/81951399
Can anyone please help me in solving this problem using the above approach or suggest something better which uses dp?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Candidate_noob | 2020-05-31 14:43:34 | 4 | ||
| en1 |
|
Candidate_noob | 2020-05-31 14:42:44 | 508 | Initial revision (published) |
