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