SPOJ CCOST — HELP!

Revision en2, by rezaulhsagar, 2017-10-04 06:34:57

Hello! I'm facing some difficulties here in this problem. I thought it would be a straightforward data structure problem. But the memory constraints here made me about to cry. Is there any way to cut the problem down to a 1D BIT?

Problem link: SPOJ — CCOST

Tags spoj, 2d binary indexed tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English rezaulhsagar 2017-10-04 06:34:57 0 (published)
en1 English rezaulhsagar 2017-10-04 06:33:31 323 Initial revision (saved to drafts)