need more problems on DFS and tree
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
cmd
|
14 years ago,
#
|
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
→
Reply
|
Madiyar
|
13 years ago,
#
^
|
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 ?
→
Reply
|
Name |
---|