| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
DP for product of products of subsequences of an array
Given an Array of N size and an integer K.How to find product of products of all subsequences of this array having size K. I tried it by Recursive Method and getting TLE for larger N... Can any one help me to find out which sub-problem is repeating in its recursive solution... What parameters should i take in my DP array?
Thanks.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
CP_Sucks_GF_Doesnt | 2018-07-10 20:26:56 | 334 | ||
| en2 |
|
CP_Sucks_GF_Doesnt | 2018-07-10 18:51:36 | 11 | Tiny change: ' DP array?' -> ' DP array?\n\nThanks.' | |
| en1 |
|
CP_Sucks_GF_Doesnt | 2018-07-10 18:51:00 | 378 | Initial revision (published) |
