Cod sursa(job #991086)
Utilizator | Dandelion paul_danut | Data | 29 august 2013 17:56:44 |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.91 kb |
#include <fstream>
#include <numeric>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int n,m,ct,a,b,sum,i,v[100001];
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=m;i++)
{
f>>ct;
if(ct==0)
{
f>>a>>b;
v[a]+=b;
}
else
if(ct==1)
{f>>a>>b;
g<<accumulate(v+a,v+b+1,0)<<'\n';}
else
if(ct==2)
{
f>>a;b=0;sum=0;
while(sum<a&&b<=n)
sum+=v[++b];
if(sum==a)
g<<b<<'\n';
else
g<<-1<<'\n';
}
}
f.close();g.close();
return 0;
}