Cod sursa(job #3282369)
| Utilizator | Data | 5 martie 2025 13:27:50 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 1.19 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
const int NMAX = 1e5;
int n, m;
int v[NMAX + 5];
int main()
{
in >> n >> m;
for(int i = 1; i <= n; ++i)
{
in >> v[i];
}
for(int i = 1; i <= m; ++i)
{
int q, a, b;
int ans = 0;
in >> q;
switch(q)
{
case 0:
{
in >> a >> b;
v[a] += b;
break;
}
case 1:
{
in >> a >> b;
for(int i = a; i <= b; ++i)
{
ans += v[i];
}
out << ans << '\n';
break;
}
case 2:
{
in >> a;
for(int i = 1; i <= n; ++i)
{
ans += v[i];
if(ans == a)
{
out << i << '\n';
break;
}
}
break;
}
}
}
return 0;
}
