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

Count of rectangles with sum = k, in a N*N matrix full of zeroes and ones.
Автор Impostor_Syndrome, история, 3 года назад, По-английски

Problem Link ---> https://codeforces.net/contest/364/problem/E

I've read the editorial, but I'm unable to understand the algo. Can anyone give a better explanation, or some resources to understand this problem. I need to understand this problem, before applying a similar logic to another problem. A similar problem appeared in one of my divid-and-conquer based test, a while ago.

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

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

If you're unable to understand a div1. E algorithm, then maybe you should try to solve easier problems.

→ Ответить