Cod sursa(job #2154654)
Utilizator | Nicu Baciu NicuBaciu | Data | 7 martie 2018 10:13:12 |
---|---|---|---|
Problema | Arbori indexati binar | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.55 kb |
#include <fstream>
#include <stdio.h>
using namespace std;
//ifstream fin("aib.in");
ofstream fout("aib.out");
int n, m;
int a[100002];
int din[100002];
FILE* f;
void read_data()
{
fscanf(f, "%d %d", &n, &m);
for(int i=1; i<=n; i++)
{
fscanf(f, "%d", &a[i]);
din[i]=din[i-1]+a[i];
}
}
int main()
{
f=fopen("aib.in", "r");
read_data();
for(int i=1; i<=m; i++)
{
int op=-1;
int x=0, y=0;
fscanf(f, "%d", &op);
//fout << op << " ";
if(op!=2)
{
fscanf(f, "%d %d", &x, &y);
//fout << x << " " << y << '\n';
}
else
{
fscanf(f, "%d", &x);
//fout << x << '\n';
}
if(op==0)
{
for(int i=x; i<=n; i++)
din[i]+=y;
}
else if(op==1)
{
fout << din[y]-din[x-1] << '\n';
}
else if(op==2)
{
int s=0;
for(int i=1; i<=n; i++)
{
if(din[i]==x)
{
fout << i << '\n';
break;
}
if(din[i]>x)
{
fout << "-1" << '\n';
break;
}
if(i==n && din[i]!=x)
{
fout << "-1" << '\n';
break;
}
}
}
}
return 0;
}