Nu aveti permisiuni pentru a descarca fisierul grader_test18.ok
Cod sursa(job #3302119)
| Utilizator | Data | 3 iulie 2025 14:35:29 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.02 kb |
#include <bits/stdc++.h>
#define NMAX 100000
using namespace std;
ifstream fin("aib.in");
ofstream fout("aib.out");
int aib[NMAX], n, m, i, cerinta, x, y;
void update(int poz, int val) {
for (; poz<=n; poz+=(poz&(-poz))) aib[poz]+=val;
}
int query(int poz) {
int sum=0;
for (; poz>0; poz-=(poz&(-poz)))
sum+=aib[poz];
return sum;
}
int cb(int nr) {
int st=1, dr=n, mij, val;
while (st<=dr) {
mij=(st+dr)/2;
val=query(mij);
if (val==nr) return mij;
if (val<nr) st=mij+1;
else dr=mij-1;
}
return -1;
}
int main()
{
fin>>n>>m;
for (i=1; i<=n; i++) fin>>x, update(i, x);
for (i=1; i<=m; i++) {
fin>>cerinta;
if (cerinta==0) {
fin>>x>>y;
update(x, y);
}
if (cerinta==1) {
fin>>x>>y;
fout<<query(y)-query(x-1)<<'\n';
}
if (cerinta==2) {
fin>>x;
fout<<cb(x)<<'\n';
}
}
return 0;
}
