We’re rewarding the question askers & reputations are being recalculated! Read more.
Search type Search syntax
Tags [tag]
Exact "words here"
Author user:1234
user:me (yours)
Score score:3 (3+)
score:0 (none)
Answers answers:3 (3+)
answers:0 (none)
isaccepted:yes
hasaccepted:no
inquestion:1234
Views views:250
Sections title:apples
body:"apples oranges"
URL url:"*.example.com"
Favorites infavorites:mine
infavorites:1234
Status closed:yes
duplicate:no
migrated:no
wiki:no
Types is:question
is:answer
Exclude -[tag]
-apples
For more details on advanced search visit our help page
Results tagged with Search options user 49216

A tree is a graph in which there is exactly one path between any two nodes. It is often used as a hierarchical data structure.

2
votes
0answers
operation. It's a classic segment tree--my very first one to be exact. I asked my friend if I need Lazy Propagation but he said no. The only optimization that I did is if tree[X]=1, I don't update it … anymore since sqrt(1) = 1 Is there a wrong implementation in my ST that causes TLE? #include<stdio.h> #include<math.h> static unsigned long long int list[100000]; static unsigned long long int tree
asked Sep 18 '16 by Realdeo