Cod sursa(job #1447177)
| Utilizator | Data | 3 iunie 2015 20:09:36 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,i,j,m,b,c,a,x,poz,s,v[100002];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++) {f>>a; v[i]=v[i-1]+a;}
for(i=1;i<=m;i++)
{
f>>a;
if(a==0) {f>>b>>c; for(j=b;j<=n;j++) v[j]+=c;}
if(a==1) {s=0; f>>b>>c; g<<v[c]-v[b-1]<<'\n';}
if(a==2) {f>>s; poz=-1;
for(j=1;j<=n;j<<=1);
j>>=1;
for(x=0;j;j>>=1)
{
if(x+j<=n)
{
if(v[x+j]<=s)
{
x+=j;
if(s==v[x]) poz=x;
}
}
}
g<<poz<<'\n';}
}
g.close();
return 0;
}
