Vid____
110 posts

Vid____
@Vid__26
Specialist @Codeforces |Knight @LC | 3 ⭐ @Codechef | 28 grad | I watch anime
Katılım Aralık 2025
39 Takip Edilen39 Takipçiler

@Vid__26 Yes.
Fenwick Tree is also called Binary Indexed Tree. It processes following queries for array:
1. Add v for index i
2. Summate of range [ l, r )
3. Get minimum i for v s.t. v <= sum of [ 0, i )
D is solved by 1 and 3. And I didn't implement the tree since I've created a snippet
English

@HarshJain_Coder Arre yaar, bas bol raha tha ki D was much more do-able than C today. 😅
English

@Vid__26 Bhaiya you are specialist, I am not...
I have never touched div 2 D till now
English

@HarshJain_Coder We'll I am a boy, pfp bohot pehle lagayi thi, will change it. 😅
English












