Cod sursa(job #1437882)
| Utilizator | Data | 18 mai 2015 19:14:49 | |
|---|---|---|---|
| Problema | Arbori indexati binar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int v[100001];
int main()
{
int n,m,i,j,op,a,b,k,s=0;
f>>n>>m;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=m;i++){
f>>op;
if(op==0) {
f>>a>>b;
v[a]=v[a]+b;}
else if(op==1) {
f>>a>>b;
s=0;
for(j=a;j<=b;j++) s=s+v[j];
g<<s<<'\n';
}
else {
f>>a;
s=0;
for (j=1;j<=n;j++) {
s+=v[j];
if (s==a) {
g<<j<<'\n';
break;
}
}
if (s!=a)
g<<-1<<'\n';
}
}
}
