Cod sursa(job #858574)

Utilizator deea101Andreea deea101 Data 19 ianuarie 2013 00:06:25
Problema SequenceQuery Scor 90
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.07 kb
#include <fstream>
using namespace std;
ifstream f("sequencequery.in");
ofstream g("sequencequery.out");
int n, v[100002], t[400100], arbs[400100], arbd[400100], ts[400100],sol,s;
void update(int i, int st, int dr)
{
	if(st==dr)
		t[i]=ts[i]=arbs[i]=arbd[i]=v[st];
	else
	{
		int mij=(st+dr)/2;
		update(2*i,st,mij);
		update(2*i+1,mij+1,dr);
		
		ts[i]=ts[2*i]+ts[2*i+1];
		arbs[i]=max(arbs[2*i],ts[2*i]+arbs[2*i+1]);
		arbd[i]=max(arbd[2*i+1],ts[2*i+1]+arbd[2*i]);
		t[i]=max(t[2*i],t[2*i+1]);
		t[i]=max(t[i],arbd[2*i]+arbs[2*i+1]);
	}
}

void query(int i, int a, int b, int st, int dr)
{
	if(a<=st && dr<=b) 
		{
			if(s<0) s=0;
			if(t[i]>sol) sol=t[i];
			if(s+arbs[i]>sol) sol=s+arbs[i];
			s+=ts[i];
			if(arbd[i]>s) s=arbd[i];
		}
	else
	{
		int mij;
		mij=(st+dr)/2;
		if(a<=mij) query(2*i,a,b,st,mij);
		if(b>mij) query(2*i+1,a,b,mij+1,dr);
	}
}
int main()
{
	int i,m,x,y;
	f>>n>>m;
	for(i=1;i<=n;i++)
	{
		f>>v[i];
	}
	update(1,1,n);
	for(i=1;i<=m;i++)
	{
		f>>x>>y;
		s=0;
		sol=v[x];
		query(1,x,y,1,n);
		g<<sol<<'\n';
	}
}