# SPOJ: GSS2 – Can you answer these queries II

Solution Idea:

```
#include &lt;bits/stdc++.h&gt;
#include &lt;ext/pb_ds/assoc_container.hpp&gt;
#include &lt;ext/pb_ds/tree_policy.hpp&gt;

#define pii              pair &lt;int,int&gt;
#define pll              pair &lt;long long,long long&gt;
#define sc               scanf
#define pf               printf
#define Pi               2*acos(0.0)
#define ms(a,b)          memset(a, b, sizeof(a))
#define pb(a)            push_back(a)
#define MP               make_pair
#define db               double
#define ll               long long
#define EPS              10E-10
#define ff               first
#define ss               second
#define sqr(x)           (x)*(x)
#define D(x)             cerr&lt;&lt;#x &quot; = &quot;&lt;&lt;(x)&lt;&lt;endl
#define VI               vector &lt;int&gt;
#define DBG              pf(&quot;Hi\n&quot;)
#define MOD              1000000007
#define CIN              ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define SZ(a)            (int)a.size()
#define sf(a)            scanf(&quot;%d&quot;,&amp;a)
#define sfl(a)           scanf(&quot;%lld&quot;,&amp;a)
#define sff(a,b)         scanf(&quot;%d %d&quot;,&amp;a,&amp;b)
#define sffl(a,b)        scanf(&quot;%lld %lld&quot;,&amp;a,&amp;b)
#define sfff(a,b,c)      scanf(&quot;%d %d %d&quot;,&amp;a,&amp;b,&amp;c)
#define sfffl(a,b,c)     scanf(&quot;%lld %lld %lld&quot;,&amp;a,&amp;b,&amp;c)
#define stlloop(v)       for(__typeof(v.begin()) it=v.begin();it!=v.end();it++)
#define loop(i,n)        for(int i=0;i&lt;n;i++)
#define loop1(i,n)       for(int i=1;i&lt;=n;i++)
#define REP(i,a,b)       for(int i=a;i&lt;b;i++)
#define RREP(i,a,b)      for(int i=a;i&gt;=b;i--)
#define TEST_CASE(t)     for(int z=1;z&lt;=t;z++)
#define PRINT_CASE       printf(&quot;Case %d: &quot;,z)
#define LINE_PRINT_CASE  printf(&quot;Case %d:\n&quot;,z)
#define CASE_PRINT       cout&lt;&lt;&quot;Case &quot;&lt;&lt;z&lt;&lt;&quot;: &quot;
#define all(a)           a.begin(),a.end()
#define intlim           2147483648
#define infinity         (1&lt;&lt;28)
#define ull              unsigned long long
#define gcd(a, b)        __gcd(a, b)
#define lcm(a, b)        ((a)*((b)/gcd(a,b)))

using namespace std;

//using namespace __gnu_pbds;
//typedef tree&lt;int, null_type, less&lt;int&gt;, rb_tree_tag, tree_order_statistics_node_update&gt; ordered_set;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//int Set(int N,int pos){return N=N | (1&lt;&lt;pos);}
//int reset(int N,int pos){return N= N &amp; ~(1&lt;&lt;pos);}
//bool check(int N,int pos){return (bool)(N &amp; (1&lt;&lt;pos));}
/*------------------------------------------------*/

#define mx 100005
#define segment_tree int l=n*2,r=l+1,mid=(b+e)/2

int ara[mx+5];
int last[2*mx+5];
ll ans[mx+5];

struct data
{
int l,r,id;
};

vector&lt;data&gt;queries;

struct data1
{
ll sum,lazy,best_lazy,ans;
data1()
{
sum=lazy=best_lazy=ans=0;
}
};

data1 tree[3*mx];

void push_down(data1 &amp;cur, data1 &amp;lft, data1 &amp;rgt)
{
//    if(cur.lazy || cur.best_lazy)
//    {
lft.best_lazy=max(lft.best_lazy,lft.lazy+cur.best_lazy);
lft.lazy+=cur.lazy;
lft.ans=max(lft.ans,lft.sum+cur.best_lazy);
lft.sum=lft.sum+cur.lazy;
rgt.best_lazy=max(rgt.best_lazy,rgt.lazy+cur.best_lazy);
rgt.lazy+=cur.lazy;
rgt.ans=max(rgt.ans,rgt.sum+cur.best_lazy);
rgt.sum+=cur.lazy;
cur.lazy=cur.best_lazy=0;
//    }
}

void push_up(data1 &amp;cur, data1 &amp;lft, data1 &amp;rgt)
{
cur.ans=max(lft.ans,rgt.ans);
cur.sum=max(lft.sum,rgt.sum);
}

void update(int n, int b, int e, int i, int j, ll val)
{
if(b&gt;j || e&lt;i) return;
if(b&gt;=i &amp;&amp; e&lt;=j)
{
tree[n].best_lazy=max(tree[n].best_lazy,tree[n].lazy+val);
tree[n].lazy+=val;
tree[n].ans=max(tree[n].ans,tree[n].sum+val);
tree[n].sum+=val;
return;
}
segment_tree;
push_down(tree[n],tree[l],tree[r]);
update(l,b,mid,i,j,val);
update(r,mid+1,e,i,j,val);
push_up(tree[n],tree[l],tree[r]);
}

data1 query(int n, int b, int e, int i, int j)
{
if(b&gt;j || e&lt;i) return data1();
if(b&gt;=i &amp;&amp; e&lt;=j)
{
return tree[n];
}
segment_tree;
push_down(tree[n],tree[l],tree[r]);
data1 p=query(l,b,mid,i,j);
data1 q=query(r,mid+1,e,i,j);
data1 ret;
push_up(ret,p,q);
return ret;
}

int main()
{

//    freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
//	  freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);
int n;
sf(n);
for(int i=1; i&lt;=n; i++) sf(ara[i]);
int m;
sf(m);
data a;
for(int i=0; i&lt;m; i++)
{
sff(a.l,a.r);
a.id=i;
queries.pb(a);
}

sort(all(queries),[](data a,data b)
{
return a.r&lt;b.r;
});

int idx=0;
for(int i=1; i&lt;=n &amp;&amp; idx&lt;SZ(queries); i++)
{
//        if(last[mx+ara[i]]!=0)
//        {
//            update(1,1,n,last[mx+ara[i]],0);
//        }
int xx=last[mx+ara[i]]+1;
update(1,1,n,xx,i,ara[i]);
last[mx+ara[i]]=i;
while(idx&lt;SZ(queries) &amp;&amp; queries[idx].r==i)
{
ans[queries[idx].id]=query(1,1,n,queries[idx].l,queries[idx].r).ans;
idx++;
}
}

for(int i=0; i&lt;m; i++)
printf(&quot;%lld\n&quot;,ans[i]);

return 0;
}

```
5 1 vote
Article Rating
Subscribe
Notify of