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

[help] hard segment tree problem
Автор Harolinch, история, 3 года назад, По-английски

Dear codeforces community, I came across this problem F: Strange Array and I am not able to solve it and not also able to understand the tutorial. can anyone please help me to solve it ? what is the idea behind it and how to approach the problem

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

»
3 года назад, # |
← Rev. 2   Проголосовать: нравится +22 Проголосовать: не нравится

If you are not able to understand the editorial, save the problem in a google docs or a word and come back to it later.

→ Ответить
»
3 года назад, # |
  Проголосовать: нравится +30 Проголосовать: не нравится

I have solved that problem. I just read the editorial, its quite descriptive. Plus the comment section in the announcement has multiple comments describing the solution in some detail with intuition. Moreover, the idea of the problem is not even hard. I just couldn't understand what one could possibly not understand. Moreover, you have not provided any concrete point that you don't understand. Don't expect anyone to hold your hand and explain to you as if you are a kid.

The problem is rated 2600, uses lazy segment tree, and you are a green. What are you doing? Solve some greedy problems first.

→ Ответить
»
3 года назад, # |
  Проголосовать: нравится +19 Проголосовать: не нравится

Do not ask for help if you do not want help :)

→ Ответить