need more problems on DFS and tree
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
cmd
|
14 лет назад,
#
|
←
Rev. 3
→
0
ignore
→
Ответить
|
cmd
|
14 лет назад,
#
|
0
Don't know about IOI tree problems, but can advice some problems from spoj: http://www.spoj.pl/PT07/problems/main/ (on spoj was tree-related contest) and some tree-related problems from acm.sgu.ru:
http://acm.sgu.ru/problem.php?contest=0&problem=195 http://acm.sgu.ru/problem.php?contest=0&problem=280 http://acm.sgu.ru/problem.php?contest=0&problem=134
→
Ответить
|
Madiyar
|
13 лет назад,
#
^
|
0
http://acm.sgu.ru/problem.php?contest=0&problem=280 trade center problem))
I have solved this task greedy O(n*k), is there any faster solution ?
→
Ответить
|
Название |
---|