Hello Everyone ,I am trying to solve this problem for some time now.I could not find an explanation in English for it anywhere . The question is related to DP (on trees) . In Brief the problem asks you to find the minimum number of edges to be removed to isolate a subtree of size p .The original problem statement can be seen here.Thanks in advance :)
→ Обратите внимание
До соревнования
Codeforces Round 955 (Div. 2, с призами от NEAR!)
07:54:58
Зарегистрироваться »
Codeforces Round 955 (Div. 2, с призами от NEAR!)
07:54:58
Зарегистрироваться »
*есть доп. регистрация
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | maroonrk | 152 |
| 4 | nor | 152 |
| 6 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | Petr | 145 |
| 8 | atcoder_official | 145 |
| 10 | pajenegod | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 25.06.2024 09:40:04 (i2).
Десктопная версия, переключиться на мобильную.
При поддержке
I think it is a dp[v][sz] with knapsack-like recalc
Thanks adelkhalilov .But Can you please elaborate on how to do transitons ??
no
A similar problem Barricades appeared in Algorithmic Engagements 2007. That has been discussed in the book Looking For A Challenge, the preview of which includes this problem. :)
Thank you satyaki3794 for help.
you are welcome