Pagini recente » Cod sursa (job #186616) | Cod sursa (job #2920158) | Cod sursa (job #958617) | Cod sursa (job #1428192) | Cod sursa (job #2221890)
#import<fstream>
int N,o,t,x,y,B['썐'];
void U(int p,int v){for(;p<=N;p+=p&-p)B[p]+=v;}
int Q(int p){int s=0,i=p;for(;i;i&=i-1)s+=B[i];return s;}
int S(int s){
int i, step;
for(step = 1; step <= N; step <<= 1);
for(i = 0; step; step >>= 1)
{
if(i + step <= N && s >= B[i + step])
{
i += step;
s -= B[i];
if(!s) return i;
}
}
return -1;
}
int main(){
std::ifstream f("aib.in");
std::ofstream g("aib.out");
for(f>>N>>o;N/++y;U(y,x))f>>x;
for(;o--;)
{
f>>t>>y;
switch(t)
{
case 0: f>>x;U(y, x);
break;
case 1: f>>x;g<<Q(x)-Q(y-1)<<'\n';
break;
case 2: g<<S(y)<<'\n';
}
}
}