Hello , Could anyone give me any hints for this problem please ? https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4299
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 162 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Hello , Could anyone give me any hints for this problem please ? https://icpcarchive.ecs.baylor.edu/index.php?option=onlinejudge&page=show_problem&problem=4299
Hello , I'm interested in finding some problems on CodeForces that is related to :
1 — Finding Bridges.
2 — Bellman Ford.
3 — Strongly Connected Components.
4 — Finding Articulation Points.
5 — Spanning Trees.
6 — Finding a negative Cycle in a graph.
Since the only tag that is specified for all of the mentioned points and many others is only "Graphs" so It is hard somehow to find a problem that is related to these points so if someone already knows some , it will be appreciated Thank you :)
Hello I was trying to solve this problem :
http://codeforces.net/contest/3/problem/B
and I could solve it by changing every 2 of size 1 to 1 of size 2 after sorting them and then take the best over all but after that I have been thinking what would be the solution if we have 2 types of sizes 3 and 4 any suggestions ? Thank you.
Название |
---|