-
Notifications
You must be signed in to change notification settings - Fork 0
/
BIT.cpp
83 lines (78 loc) · 2.32 KB
/
BIT.cpp
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
#include<bits/stdc++.h>
#define pf printf
#define sc scanf
#define PI 2*acos(0.0)
#define fast ios_base::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define mem(a,b) memset(a, b, sizeof(a) )
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define MAX 1234567899
#define mod 1000000007
#define all(v) (v).begin(),(v).end()
#define vSort(v) sort(all(v))
#define maxSort(v) sort(all(v),greater<int>())
#define Unique(v) v.erase(unique(all(v)),v.end())
#define sqr(x) ((x)*(x))
#define qube(x) ((x)*(x)*(x))
#define deci(n) cout<<fixed<<setprecision(n)
#define sci(n) sc("%d",&(n))
#define scii(x,y) sc("%d %d",&(x),&(y))
#define scl(x) sc("%lld",&(x))
#define scll(x,y) sc("%lld %lld",&(x),&(y))
#define vi vector<int>
#define hi pf(" HI \n")
#define pp pair<int,int>
#define pb(x) push_back(x)
#define mp(x,y) make_pair(x,y)
#define F first
#define S second
#define check(n,pos) (n & (1<<(pos)))
#define biton(n,pos) (n (1<<(pos)))
#define bitoff(n,pos) (n & ~(1<<(pos)))
typedef long long int lli;
typedef unsigned long long int ulli;
int dx4[] = { 0 , 0 , -1 , 1 } ;
int dy4[] = { -1 , 1 , 0 , 0 } ;
bool valid( int r , int c , int x , int y ){
if( x >= 1 && x <= r && y >= 1 && y <= c ) return 1 ; return 0 ;}
using namespace std;
int tree[1000000];
int a[1000000];
int n;
void update(int pos,int val)
{
while(pos<=n)
{
tree[pos]+=val;
pos+= (pos & -pos);
}
}
int query(int pos)
{
int sum=0;
while(pos>0)
{
sum+=tree[pos];
pos-= (pos & -pos);
}
return sum;
}
int main ()
{
cin >> n;
for(int i=1;i<=n;i++){
cin >> a[i];
update(i,a[i]);
}
int q;
cin >> q;
int x,y;
for(int i=1;i<=q;i++)
{
cin >> x>> y;
int ami= query(y);
int tmi= query(x-1);
cout << ami- tmi <<endl;
}
return 0;
}