Pagini recente » Cod sursa (job #2714748) | Cod sursa (job #1112972) | Cod sursa (job #1364440) | Cod sursa (job #229033) | Cod sursa (job #2786377)
#include <fstream>
using namespace std;
ifstream cin("test.in");
ofstream cout("test.out");
int n, m, tree[100001];
int sum(int i) {
int suma = 0;
while(i > 0) {
suma += tree[i];
i -= i&-i;
}
return suma;
}
void add(int i, int x) {
while(i <= n) {
tree[i] += x;
i += i&-i;
}
}
int main()
{
cin>>n>>m;
for(int i = 1; i<=n; i++) {
int val; cin>>val;
add(i, val);
}
int x, y;
for(; m; --m) {
short c; cin>>c;
if(c == 0) {
cin>>x>>y;
add(x, y);
}
if(c == 1) {
cin>>x>>y;
cout<<sum(y) - sum(x - 1)<<'\n';
}
if(c == 2) {
cin>>x;
int p = 0;
for(int pas = n/2; pas; pas/=2)
while(p + pas <= n && sum(p + pas) <= x)
p += pas;
if(sum(p) == x)
cout<<p<<'\n';
else
cout<<-1<<'\n';
}
}
return 0;
}