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

How To Solve These Type Of Problems?
Автор ._JO_., история, 16 месяцев назад, По-английски

Hello Guys

For these types of problems under which tag are they and how to practice it?

https://mirror.codeforces.com/contest/1453/problem/B

and if any one has a link for some problems to master it, I'll be grateful

thanks in advance

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

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

this my solution for this problem how to think in that? first think in pre-calculation then how to update this calculation so it take minimum time to get the answer for the every postion. in this problem we easily could solve it in o(n^2) by ignoring every num once and calculate the ans and take minimum but if you observe you only affect on 3 segment so why every time recalculate the whole array so you think to memorize answer for the unaffected part so i calculate the answer for whole array without using the special update of element then brute force on every index and take best it sort of dp.

type of problems to pratice in order to improve on this style: implementation and constructive algorithm

→ Ответить
  • »
    »
    16 месяцев назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    thanks a lot; could you tell me your practice style?

    what are the problems you solve? which sheet, and if you use one, please share it with me

    → Ответить