×

# Why segment tree failed for "Counting In Byteland"?

 0 Hi, This is the problem Counting In Byteland Segment Tree Solution BIT Solution I did this question using segment tree during the contest, got TLE. I got this idea from here. I guess my solution have following time and Space complexity:  update : (logN)^3 query : (logN)^3 space : 8*(8^log8(N))-1  Reference According to the solution, the author gave 3-D BIT solution. What is complexity of segment tree of update and query? This question is marked "community wiki". asked 06 Oct '16, 16:59 1.1k●12●29 accept rate: 6%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×1,727
×393
×371
×263
×141

question asked: 06 Oct '16, 16:59

question was seen: 541 times

last updated: 06 Oct '16, 16:59