Pagini recente » Cod sursa (job #2833716) | Cod sursa (job #1351265) | Cod sursa (job #1137660) | Cod sursa (job #2638397) | Cod sursa (job #2426847)
#include <fstream>
using namespace std;
ifstream in("aib.in");
ofstream out("aib.out");
int aib[100010], n, m;
int query (int p)
{
int s=0;
while (p>0)
{
s+=aib[p];
p-=p&(-p);
}
return s;
}
void update (int p, int val)
{
while (p<=n)
{
aib[p]+=val;
p+=p&(-p);
}
}
int caut(int val)
{
int r=0, pas=1<<16;
//if (query(n) < val) return -1;
int c = val;
while (pas != 0)
{
if (r + pas <= n && aib[r + pas] <= val)
{
r+=pas;
val -= aib[r];
}
pas/=2;
}
//if (query(r+1) != c) r=-1;
//else r++;
if (val > 0)
{
r = -1;
}
return r;
}
int main()
{
int a, b, c, nr;
in>>n>>m;
for (int i=1; i<=n; i++)
{
in>>nr;
update (i, nr);
}
for (int i=1; i<=m; i++)
{
in>>nr;
if (nr==0)
{
in>>a>>b;
update (a, b);
}
if (nr==1)
{
in>>a>>b;
out<<query(b)-query(a-1)<<"\n";
}
if (nr==2)
{
in>>a;
out<<caut(a)<<"\n";
}
}
return 0;
}