Блог пользователя Hd7

Автор Hd7, история, 7 лет назад, По-английски

I have recently learn about Kruskals' Algorithm to solve Minimum Spanning Tree. I click problems under the tutorial and that leads me to 2500 tag problem. I tend to solve it but after seeing *2500 tag, i lose all of my confident =)). Lmao!!! Could you give me some advice. Thanks in advance.

  • Проголосовать: нравится
  • +8
  • Проголосовать: не нравится

»
7 лет назад, скрыть # |
 
Проголосовать: нравится +9 Проголосовать: не нравится

Believe in yourself.

Remember you can solve it!

»
7 лет назад, скрыть # |
 
Проголосовать: нравится -7 Проголосовать: не нравится

I think that problem is a pretty good measure of how well you actually understand Kruskal's algorithm. So it should be fine.

The problem difficulties are wildly high sometimes. Supposedly it means that 1/2 of rating 2500 people would solve it during the contest, but I can't see how anyone at that rating wouldn't solve it during the contest.

»
7 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I don't have any numbers supporting me, but I don't think you should attempt such a difficult problem. Maybe, if it's an area of your expertise, you might try to solve it, but try to control your expectations. Personally, I aim at problems 100-300 points ahead of my current rating (sometimes I can solve *2000 problems, but it's not common). Harder problems might produce a counter effect and discourage you (at least that happens to me if I try hard problems). Whatever you do, check if it's productive for your progress

»
7 лет назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится
»
7 лет назад, скрыть # |
 
Проголосовать: нравится +8 Проголосовать: не нравится

Hard tags are often quite confusing. You'd better try to turn off tags to unsolved problems not to discourage yourself.