Cod sursa(job #449866)

Utilizator siminescuPaval Cristi Onisim siminescu Data 7 mai 2010 01:02:15
Problema Arbori indexati binar Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<fstream>
using namespace std;
# define nmax 100001
int v[nmax],s[nmax],n,m,a,b;
ifstream f("aib.in");
ofstream g("aib.out");
void b_search()
{
	int st=1,dr=n,mij;
	while(st<dr)
	{
		mij=(st+dr)/2;
		if(s[mij]>=a) dr=mij;
		else st=mij+1;
	}
	if(s[st]==a) g<<st<<'\n';
	else g<<"-1\n";
}
int main()
{
	f>>n>>m;int x,i;
	for(i=1;i<=n;i++) { f>>v[i]; s[i]=s[i-1]+v[i]; }
	for(;m;--m)
	{
		f>>x;
		if(!x)
		{
			f>>a>>b;;
			for(i=a;i<=n;i++) s[i]+=b;
		}
		if(x==1)
		{
			f>>a>>b;g<<s[b]-s[a-1]<<'\n';
		}
		if(x==2)
		{
			f>>a;
			b_search();
		}
	}
}