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

Автор Aspergillus, история, 2 года назад, По-английски

Hello all today I struggled a lot with C2, especially because I am not used to using sets, actually not used to using any data structure other than map or vector, I have used queues for BFS only. So I have decided to spend a few days with them.

Please suggest some problems, which are not higher than maybe 2000 rated on CF equivalent, which cannot be solved in desired time or memory without specific data steuctures. One example is stacks for finding the nearest element smaller in the left/right using stack (or vector with push back). Another example maybe using sets to maintain indexes of appearances with updates, which was used in C2. Some people say some sorts of balanced paranthesis substring problems can be solved only using stack but I have only ever used a map for that purpose at best.

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

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

APIO14_palindrome

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

C2 was crazy. I don't wanna say that that sort of problem is boring, but there is a time and a place for those sort of things. Certainly the appropriate place isn't a div. 2 C, is it?

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

I'm not sure what you're complaining about for C2. AFAIK the problem doesn't need any advanced techniques. My solution only uses basic understanding of arrays and a set. 284778921