Scribd Logo
Upload

Welcome to Scribd!

  • 76 views

    Fenwick Tree Lazy Propagation - Codeforces

    Uploaded by

    Sanjeev Singh
    This document describes how to optimize Fenwick trees to support lazy propagation updates. Fenwick trees allow efficient calculation of prefix sums but normally require recalculating the whole tree for updates. With lazy propagation, updates are stored in a separate array and propagated lazily during queries, avoiding unnecessary recalculations. This improves the time complexity of updates from O(log n) to O(1) while maintaining O(log n) queries.

    Copyright:

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

    You might also like

    Fenwick Tree Lazy Propagation - Codeforces

    Uploaded by

    Sanjeev Singh
    76 views3 pages
    This document describes how to optimize Fenwick trees to support lazy propagation updates. Fenwick trees allow efficient calculation of prefix sums but normally require recalculating the whole tree for updates. With lazy propagation, updates are stored in a separate array and propagated lazily during queries, avoiding unnecessary recalculations. This improves the time complexity of updates from O(log n) to O(1) while maintaining O(log n) queries.

    Original Description:

    Competitive Programming...

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes how to optimize Fenwick trees to support lazy propagation updates. Fenwick trees allow efficient calculation of prefix sums but normally require recalculating the whole tree for updates. With lazy propagation, updates are stored in a separate array and propagated lazily during queries, avoiding unnecessary recalculations. This improves the time complexity of updates from O(log n) to O(1) while maintaining O(log n) queries.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    76 views3 pages

    Fenwick Tree Lazy Propagation - Codeforces

    Uploaded by

    Sanjeev Singh
    This document describes how to optimize Fenwick trees to support lazy propagation updates. Fenwick trees allow efficient calculation of prefix sums but normally require recalculating the whole tree for updates. With lazy propagation, updates are stored in a separate array and propagated lazily during queries, avoiding unnecessary recalculations. This improves the time complexity of updates from O(log n) to O(1) while maintaining O(log n) queries.

    Copyright:

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

    9/14/2016 FenwickTreeLazyPropagationCodeforces

    http://codeforces.com/blog/entry/10306 1/3
    9/14/2016 FenwickTreeLazyPropagationCodeforces

    http://codeforces.com/blog/entry/10306 2/3
    9/14/2016 FenwickTreeLazyPropagationCodeforces

    http://codeforces.com/blog/entry/10306 3/3

    You might also like