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

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

Hello codeforces,

I was solving IZHO problems from past years but I couldn't solveIZHO 201problem E — "K blocks" (link; the second problem). I wrote the O( N * N * K ) dp solution, but I'm not sure how to reduce it to O( N * K ). I tought of Convex hull trick, but unfortunately i don't know how to apply it.

So can someone share his solution? Thanks ;)

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

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

You can find information about that task on some previous blogs(I remember that someone also write blog about it).

Can anyone tell me about this year IZHO? Will it be organized and when?

UPD: Here is blog about your task link