Pagini recente » Borderou de evaluare (job #37701) | Cod sursa (job #511107) | Borderou de evaluare (job #2019105) | Borderou de evaluare (job #1941128) | Cod sursa (job #2509313)
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,aib[100005],c,a,b,x;
void update(int x,int p)
{
int i;
for (i=p;i<=n;i+=(i&(-i)))
aib[i]+=x;
}
int suma(int p)
{
int i,s=0;
for (i=p;i>0;i-=(i&(-i)))
s+=aib[i];
return s;
}
int cautare(int k)
{
int st=1,dr=n,mijl;
while (st<=dr)
{
mijl=(st+dr)/2;
if (suma(mijl)==k) return mijl;
else if (suma(mijl)<k) st=mijl+1;
else dr=mijl-1;
}
return -1;
}
int main()
{
int i;
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>x;
update(x,i);
}
for (i=1;i<=m;i++)
{
f>>c;
if (c==0) {f>>a>>b;update(b,a);}
else if (c==1) {
f>>a>>b;
g<<suma(b)-suma(a-1)<<'\n';
}
else {
f>>a;
g<<cautare(a)<<'\n';
}
}
return 0;
}