FastDB/segmenttree.cpp at main · ParvJain227/FastDB · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include<bits/stdc++.h>
#define int long long
using namespace std;
class mintree{
public:
    vector<int> seg;
    vector<int> arr;
    int merge(int a,int b){
        return std::min(a,b);
    }
    mintree(vector<int>& a){
        arr=a;
        int n=arr.size();
        seg.resize(4*n);
        f(0,0,n-1);
    }
    void f(int ind,int low,int high){
        if(low==high){
            seg[ind]=arr[low];
            return;
        }
        int mid = (low + high) / 2;
        f(2*ind+1,low,mid);
        f(2*ind+2,mid+1,high);
        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    void update(int ind,int pos,int val,int low,int high){
        if(low==high){
            arr[pos]=val;
            seg[ind]=val;
            return;
        }
        int mid=(low+high)/2;
        if(pos<=mid)
        update(2*ind+1,pos,val,low,mid);
        else
        update(2*ind+2,pos,val,mid+1,high);
        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    int query(int ind,int low,int high,int l,int r){
        if(high<l||low>r)
            return LLONG_MAX;
        if(low>=l&&high<=r)
            return seg[ind];
        int mid=(low+high)/2;
        int left=query(2*ind+1,low,mid,l,r);
        int right=query(2*ind+2,mid+1,high,l,r);
        return merge(left,right);
    }
};
class maxtree{
public:
    vector<int> seg;
    vector<int> arr;
    int merge(int a,int b){
        return std::max(a,b);
    }
    maxtree(vector<int>& a){
        arr=a;
        int n=arr.size();
        seg.resize(4*n);
        f(0,0,n-1);
    }
    void f(int ind,int low,int high){
        if(low==high){
            seg[ind]=arr[low];
            return;
        }
        int mid = (low + high) / 2;
        f(2*ind+1,low,mid);
        f(2*ind+2,mid+1,high);
        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    void update(int ind,int pos,int val,int low,int high){
        if(low==high){
            arr[pos]=val;
            seg[ind]=val;
            return;
        }
        int mid=(low+high)/2;

        if(pos<=mid)
        update(2*ind+1,pos,val,low,mid);
        else
        update(2*ind+2,pos,val,mid+1,high);
        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    int query(int ind,int low,int high,int l,int r){
        if(high<l||low>r)
            return LLONG_MIN;
        if(low>=l&&high<=r)
            return seg[ind];
        int mid=(low+high)/2;
        int left=query(2*ind+1,low,mid,l,r);
        int right=query(2*ind+2,mid+1,high,l,r);
        return merge(left,right);
    }
};
class sum{
public:
    vector<int> seg;
    vector<int> arr;
    int merge(int a,int b){
        return a+b;
    }
    sum(vector<int>& a){
        arr=a;
        int n=arr.size();
        seg.resize(4*n);
        f(0,0,n-1);
    }
    void f(int ind,int low,int high){
        if(low==high){
            seg[ind]=arr[low];
            return;
        }
       int mid = (low + high) / 2;
        f(2*ind+1,low,mid);
        f(2*ind+2,mid+1,high);
        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    void update(int ind,int pos,int val,int low,int high){
        if(low==high){
            arr[pos]=val;
            seg[ind]=val;
            return;
        }
        int mid=(low+high)/2;
        if(pos<=mid)
        update(2*ind+1,pos,val,low,mid);
        else
        update(2*ind+2,pos,val,mid+1,high);

        seg[ind]=merge(seg[2*ind+1],seg[2*ind+2]);
        return;
    }
    int query(int ind,int low,int high,int l,int r){
        if(high<l||low>r)
            return 0;
        if(low>=l&&high<=r)
            return seg[ind];
        int mid=(low+high)/2;
        int left=query(2*ind+1,low,mid,l,r);
        int right=query(2*ind+2,mid+1,high,l,r);
        return merge(left,right);
    }
};