Codeforces Round #851 (Div. 2) E. Sum Over Zero

Codeforces Round #851 (Div. 2) E. Sum Over Zero

Denote $p$ as the prefix sum of $a$.For a segment $[x+1,y]$ to be an element of $S$,$p_x\le p_y$ should be satisfied.

Lets denote $d{p}_i$; as the maximum value of the sum of length of segment smaller than $i$ in $S$. Segment $[x,y]$ is smaller than $i$ if $y\le i$.lf there is no segment ending at $i$, $d{p}_i=d{p}_{i-1}$. f there is segment $[k+1,i]$ in $S$, $d{p}_i$ = $ma{x}_{pk\le pi}$$(d{p}_k+i-k)$. By summing up, $d{p}_i$ $=$max$ $(d{p}_{i-1},ma{x}_{pk<pi}(d{p}_k＋i-k)$ with this dp, we get an $O(N^2)$ solution.

Nowlets try to speed up the dp transtion using segment ree. First,use coordinate compression on $p_i$ since we only see whether oneprefix sum is bigger than the other. We will maintain a segment tree that stores $d{p}_k-k$ in position $p_k$.

Let’s find $d{p}_i$ in order of $i$. $d{p}_i$ $=$ $max(d{p}_{i-1},ma{x}_{pk\le pi}(d{p}_k-k)+i)$ We can solve $ma{x}_{pk\le pi}(d{p}_k-k)$ by range query $[0,p_i]$ on a segment tree. So we can solve $d{p}_i$ in $O(logN)$ for each $i$.

The entire problem is solved in $O(NlogN)$.

There is an alternative solution that maintains pair $(d{p}_k-k,p_k)$ monotonically with a set. This soluton also nuns in $O(NlogN)$

#include<bits/stdc++.h>
using namespace std;


typedef long long LL; 
const int N = 200010;

int tr[N];
 
int lowbit(int x)
{
    return x&-x;
}
 
void add(int x,int v)
{
    for(int i=x;i<N;i+=lowbit(i))
        tr[i]=max(tr[i],v);
}
 
int query(int x)
{
    int res=-0x3f3f3f3f;
    for(int i=x;i>0;i-=lowbit(i))
        res=max(res,tr[i]);
    return res;
}
 
int main()
{
	int n;cin>>n;
    vector<int> a(n+1);
    for(int i=1;i<=n;i++) cin>>a[i];
    vector<LL> s(n+1);
    for(int i=1;i<=n;i++) s[i]+=s[i-1]+a[i];
 
    auto v=s;
    sort(v.begin(),v.end());
 
    vector<int> dp(n+1);
    memset(tr,-0x3f,sizeof tr);
    int x=lower_bound(v.begin(),v.end(),s[0])-v.begin()+1;
    add(x,0);
 
    for(int i=1;i<=n;i++)
    {
        x=lower_bound(v.begin(),v.end(),s[i])-v.begin()+1;
        dp[i]=max(dp[i-1],i+query(x));
        add(x,dp[i]-i);
    }
    cout<<dp[n]<<endl;

    return 0;
}