Hello Codeforces .
Plase help.
Given n, array a(a1, a2,,, an). n, a[i] <= 100.
How can i make dp[i][j].
Corectly dp[i][j] = 1, if we can get sum j without a[i].
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
7 | adamant | 154 |
9 | Um_nik | 152 |
10 | djm03178 | 146 |
Hello Codeforces .
Plase help.
Given n, array a(a1, a2,,, an). n, a[i] <= 100.
How can i make dp[i][j].
Corectly dp[i][j] = 1, if we can get sum j without a[i].
Name |
---|
How can you say its easy if you are stuck in it and asking for help? :/
it is easy for some people
I have thought of a solution.
Take dpt[j] be the number of ways you can make the sum j using any elements. So, for each sum from 1 to 10000, you take each of the a[i] into consideration and do a dpt[sum-a[i]]++.
Now, dp[i][j] is 1 if dpt[j]>=2 or else its 0.
What are the constraints on n ?
If you don't mind, can you put a link to the exact question. This is kind of hard to understand.
"n, a[i] <= 100"
Calculate DP for prefixes and suffixes. Now, DP[i][j] = 1 if there exists A and B such that A+B=j and A is obtained as sum from prefix and B is obtained as sum from suffix.