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].
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
11:04:07
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
11:04:07
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 09.11.2024 06:30:53 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.