Pagini recente » Cod sursa (job #1696379) | Cod sursa (job #826890) | Cod sursa (job #2897574) | Cod sursa (job #1193896) | Cod sursa (job #2433056)
#include <bits/stdc++.h>
#define f(a) (a & -a)
using namespace std;
ifstream fin ("aib.in");
ofstream fout ("aib.out");
const int INF = (1 << 29);
const int NMAX = 100003;
int AIB [NMAX];
int n, m, a, b, tip;
void UP (int I, int X){
for (int i = I; i <= n; i += f (i))
AIB [i] += X;
}
int Q (int I){
int S = 0;
for (int i = I; i >= 1; i -= f (i))
S += AIB [i];
return S;
}
int FF (int A){
int G, I = INF, k;
G = k = 0;
while (I){
if (G + I <= n){
if (k + AIB [G + I] <= A){
k += AIB [G + I], G += I;
if (A == k)return G;
}
}
I /= 2;
}
return -1;
}
int main (){
fin >> n >> m;
for (int i = 1; i <= n; i ++)
fin >> a, UP (i, a);
for (int i = 1; i <= m; i ++){
fin >> tip;
if (tip == 0){
fin >> a >> b;
UP (a, b);
}
else if (tip == 1){
fin >> a >> b;
fout << Q (b) - Q (a - 1) << '\n';
}
else if (tip == 2){
fin >> a;
fout << FF (a) << '\n';
}
}
return 0;
}