Pagini recente » Cod sursa (job #2284098) | Cod sursa (job #837549) | Cod sursa (job #286940) | Cod sursa (job #1907979) | Cod sursa (job #2803506)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
#define DIM 100000
#define Ub(x) (x & -x)
int aib[DIM + 1], n, m, a, b, tip, s;
static inline void Add(int poz, int val) {
for(int i = poz; i <= n; i += Ub(i))
aib[i] += val;
}
static inline long long Suma(int poz) {
long long s = 0;
for(int i = poz; i >= 1; i -= Ub(i))
s += aib[i];
return s;
}
static inline int CautBinar(int x) {
int st = 1, dr = n, poz = -1;
while(st <= dr && poz == -1) {
int mid = (st + dr) >> 1;
long long sum = Suma(mid);
if(x == sum)
poz = mid;
if(x < sum)
dr = mid - 1;
else st = mid + 1;
}
return poz;
}
int main() {
fin >> n >> m;
for(int i = 1; i <= n; i++) {
fin >> a;
Add(i, a);
}
for(int i = 1; i <= m; i++) {
fin >> tip;
if(tip == 0) {
fin >> a >> b;
Add(a, b);
}else if(tip == 1) {
fin >> a >> b;
fout << Suma(b) - Suma(a - 1) << '\n';
}else {
fin >> s;
fout << CautBinar(s) << '\n';
}
}
return 0;
}