MCPcopy Create free account
hub / github.com/codemistic/Data-Structures-and-Algorithms / solve

Function solve

CPP/Segment Tree/Sum query.cpp:141–158  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

139}
140
141void solve(){
142 ll n;
143 cin>>n;
144 vl vec(n);
145 input(vec);
146
147 vl segtree(4*n+1);
148 //TreeBuild
149 build_segtree(vec,1,0,n-1,segtree); //(input array,curr. vertex,start,end,segtree array,size)
150
151 //Sum-query
152 cout<<sum_segtree(1,0,n-1,0,2,segtree)<<endl;
153
154 //Update-query
155 update_segtree(1,0,n-1,2,3,segtree);
156 cout<<sum_segtree(1,0,n-1,0,2,segtree)<<endl;
157
158}
159
160int main(){
161ios_base::sync_with_stdio(false);

Callers 1

mainFunction · 0.70

Calls 3

sum_segtreeFunction · 0.85
build_segtreeFunction · 0.70
update_segtreeFunction · 0.70

Tested by

no test coverage detected