StackOverflow Questions for Tag: binary-indexed-tree

Vishal Jangid

Reputation: 418

How to Use Binary Indexed Tree for Counting Reverse Pairs in an Array?

arraysalgorithmoptimizationtreebinary-indexed-tree

Score: 1

Answers: 1

Rupasai Rangaraju

Reputation: 1

Why we need two fenwick tree to get range sum of [l, r] given there are array of numbers and range updates and queries are performed on the array?

fenwick-treebinary-indexed-tree

Score: 0

Answers: 1

eleven22

Reputation: 93

What does "x += x & (-x)" mean?

c++bit-manipulationbitwise-operatorssegment-treebinary-indexed-tree

Score: 7

Answers: 4

Hlib Pylypets

Reputation: 358

Fenwick tree(BIT). Find the smallest index with given cumulative frequency in O(logN)

c++algorithmbinary-searchfenwick-treebinary-indexed-tree

Score: 0

Answers: 1

0xAliHn

Reputation: 19270

Difference between Binary Search Tree and Binary Index Tree

treebinary-search-treebinary-indexed-tree

Score: 3

Answers: 0

ihainan

Reputation: 75

Binary Indexed Tree: Why does "i + lowBit(i)" work?

algorithmbinary-indexed-tree

Score: 3

Answers: 0

halcyon44

Reputation: 13

Quick Way of Finding How many Substrings has first and last character repeated inside

algorithmsubstringtime-complexitybinary-indexed-tree

Score: 1

Answers: 1

user43389

Reputation: 731

Update step in Fenwick Trees

algorithmfenwick-treebinary-indexed-tree

Score: 4

Answers: 1

Kushagra

Reputation: 41

how to increase the size limit of a mutable list in kotlin?

kotlinsizefenwick-treemutablelistbinary-indexed-tree

Score: 0

Answers: 1

piedpiper

Reputation: 1360

How can we calculate weighted cumulative sum of squares with prefix range updates by one?

algorithmsortingsegment-treebinary-indexed-tree

Score: 3

Answers: 0

Nedas Bolevičius

Reputation: 321

C++ Counting inversions in array, Fatal Signal 11 (BIT)

c++algorithmbinary-indexed-tree

Score: 0

Answers: 1

bordus

Reputation: 35

Count "minimal" values

c++algorithmdata-structuressegment-treebinary-indexed-tree

Score: 1

Answers: 2

thule

Reputation: 4222

Can someone please explain the solution to "Almost sorted intervals" to me?

algorithminterval-treebinary-indexed-tree

Score: 1

Answers: 2

Chandan Mittal

Reputation: 75

Range update in Binary Indexed Tree

rangebinary-indexed-tree

Score: 1

Answers: 2

Diego Becquer

Reputation: 81

Answer queries about the number of distinct numbers in a given range

algorithmdata-structuresbinary-indexed-tree

Score: 1

Answers: 1

Brian Lee

Reputation: 51

how to get inversion count with update

countmergesortinversionbinary-indexed-tree

Score: 1

Answers: 0

goku

Reputation: 156

can someone provide me the algorithm of 2-d binary indexed tree?

c++algorithmfenwick-treebinary-indexed-tree

Score: 0

Answers: 1

nRT

Reputation: 13

String query with binary indexed tree

c++segment-treefenwick-treebinary-indexed-tree

Score: 0

Answers: 1

aroma

Reputation: 1421

Application of binary indexed tree

algorithmtreebinary-indexed-tree

Score: 1

Answers: 1

Roshan

Reputation: 150

range XORed sum using BIT or Fenwick tree

algorithmxorfenwick-treebinary-indexed-tree

Score: 1

Answers: 1

PreviousPage 1Next

StackOverflow Questions for Tag: binary-indexed-tree

How to Use Binary Indexed Tree for Counting Reverse Pairs in an Array?

Why we need two fenwick tree to get range sum of [l, r] given there are array of numbers and range updates and queries are performed on the array?

What does &quot;x += x &amp; (-x)&quot; mean?

Fenwick tree(BIT). Find the smallest index with given cumulative frequency in O(logN)

Difference between Binary Search Tree and Binary Index Tree

Binary Indexed Tree: Why does &quot;i + lowBit(i)&quot; work?

Quick Way of Finding How many Substrings has first and last character repeated inside

Update step in Fenwick Trees

how to increase the size limit of a mutable list in kotlin?

How can we calculate weighted cumulative sum of squares with prefix range updates by one?

C++ Counting inversions in array, Fatal Signal 11 (BIT)

Count &quot;minimal&quot; values

Can someone please explain the solution to &quot;Almost sorted intervals&quot; to me?

Range update in Binary Indexed Tree

Answer queries about the number of distinct numbers in a given range

how to get inversion count with update

can someone provide me the algorithm of 2-d binary indexed tree?

String query with binary indexed tree

Application of binary indexed tree

range XORed sum using BIT or Fenwick tree

What does "x += x & (-x)" mean?

Binary Indexed Tree: Why does "i + lowBit(i)" work?

Count "minimal" values

Can someone please explain the solution to "Almost sorted intervals" to me?