Submission #646447

#	Time	Username	Problem	Language	Result	Execution time	Memory
646447		mihneacazan	Sum Zero (RMI20_sumzero)	C++17	0 / 100	111 ms	65536 KiB

sumzero

#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ll long long
#define zeros(x) ( (x ^ (x - 1)) & x )

using namespace std;
unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 rng(seed);
#define rand() rng()
/*const long long mod = 998244353;
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
long long v[200005];*/
const ll N=2e5+5;
ll n,v[5005],nxt[5005],dp[5005][5005];
void solve()
{
    cin>>n;
    for(ll i=1;i<=n;i++)
        cin>>v[i];
    for(ll i=1;i<=n;i++)
    {
        ll sum=0;
        nxt[i]=0;
        for(ll j=i;j<=n;j++)
        {
            sum+=v[j];
            if(sum==0)
            {
                nxt[i]=j;
                break;
            }
        }
    }
    for(ll r=n;r>=1;r--)
    {
        for(ll l=r;l>=1;l--)
        {
            if(l==r)
               {
                   if(v[l]==0)
                      dp[l][r]=1;
                   else
                       dp[l][r]=0;
               }
            else
                {
                    if(v[l]==0)
                       dp[l][r]=1+dp[l+1][r];
                    else
                        {
                            dp[l][r]=dp[l+1][r];
                            if(nxt[l]<=r && nxt[l]>0)
                               dp[l][r]=max(dp[l][r],dp[nxt[l]][r]+1);
                        }
                }
            //cout<<l<<" "<<r<<" "<<dp[l][r]<<"\n";
        }
    }
    ll q;
    cin>>q;
    while(q--)
    {
        ll l,r;
        cin>>l>>r;
        cout<<dp[l][r]<<"\n";
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t=1;
    //cin>>t;
    while(t--)
        solve();
    return 0;
}

• Subtask 1: 0 / 22
• Subtask 2: 0 / 39
• Subtask 3: 0 / 39