| 139 | } |
| 140 | |
| 141 | void 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 | |
| 160 | int main(){ |
| 161 | ios_base::sync_with_stdio(false); |
no test coverage detected