Pagini recente » Cod sursa (job #2851864) | Cod sursa (job #2843950) | Cod sursa (job #1822110) | Cod sursa (job #548438) | Cod sursa (job #1743489)
#include <fstream>
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
int arb[100005];
int n, m;
int x;
int op, a, b;
void add(int idx, int val)
{
while(idx <= n){
arb[idx] += val;
idx += idx & -idx;
}
}
int sum(int idx)
{
int s = 0;
while(idx){
s += arb[idx];
idx -= idx & -idx;
}
return s;
}
int k_thTerm(int val)
{
int left = 1;
int right = n;
int mid = -1;
while(right - left > 1){
mid = (left+right)/2;
sum(mid) < val ? left = mid: right = mid;
}
return sum(left) == val ? left : sum(right) == val ? right : -1;
}
int main()
{
in >> n >> m;
for(int i=1; i<=n; i++){
in >> x;
add(i, x);
}
for(int i=0; i<m; i++){
in >> op;
if(op == 2){
in >> a;
out << k_thTerm(a) << '\n';
}else{
in >> a >> b;
if(op == 0){
add(a, b);
}else{
out << sum(b) - sum(a-1) << '\n';
}
}
}
return 0;
}