Scribd Logo
Upload

Welcome to Scribd!

  • Fenwick-Tree (Binary Indexed Tree)

    Uploaded by

    Susmit Kumar Mishra
    82 views1 page
    This C++ code implements a binary indexed tree (also known as a Fenwick tree) which supports log(n) time range sum and update queries on an array. The code includes functions to construct the binary indexed tree from an input array, add a value to an element in the tree, and sum values in a given range of the tree.

    Original Description:

    Original Title

    Fenwick-tree(Binary Indexed Tree).txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This C++ code implements a binary indexed tree (also known as a Fenwick tree) which supports log(n) time range sum and update queries on an array. The code includes functions to construct the binary indexed tree from an input array, add a value to an element in the tree, and sum values in a given range of the tree.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    82 views1 page

    Fenwick-Tree (Binary Indexed Tree)

    Uploaded by

    Susmit Kumar Mishra
    This C++ code implements a binary indexed tree (also known as a Fenwick tree) which supports log(n) time range sum and update queries on an array. The code includes functions to construct the binary indexed tree from an input array, add a value to an element in the tree, and sum values in a given range of the tree.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    #include<bits/stdc++.

    h>
    using namespace std;
    //supports log(n) query update and range sum queries
    // this is 1 based indexing
    template <typename T>
    T sum(vector<T>&tree,T k)
    {
    T s=0;
    while(k>=1)
    {
    s+=tree[k];
    k-=k&-k;
    }
    return s;
    }
    // increase the value at k by x
    template<typename T>
    T add(vector<T>&tree,T k,T x)
    {
    T n=tree.size()-1;
    while(k<=n)
    {
    tree[k]+=x;
    k+=k&-k;
    }
    return ;
    }
    template<typename T>
    void construction(vector<T>&a,vector<T>&tree)
    {
    T i,n=a.size()-1;
    vector<T>dp(n+1,0);
    for(i=1;i<=n;i++)
    dp[i]=dp[i-1]+a[i];
    for(i=1;i<=n;i++)
    tree[i]=dp[i]-dp[i-k&-k];
    return ;
    }
    int main()
    {

    You might also like