제출 #928861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928861		fdnfksd	Sum Zero (RMI20_sumzero)	C++14	61 / 100	392 ms	51784 KiB

sumzero

#include<bits/stdc++.h>
#define pb push_back
#define pli pair<int,int>
#define fi first
#define se second
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL);
using namespace std;
using ll=long long;
const ll maxn=4e5+100;
const ll inf=1e18;
const ll mod=1e9+7;
ll n,a[maxn];
map<ll,ll>mp;
int nxt[maxn],mn[maxn],p[maxn][21];;
void solve()
{
    cin >> n;
    for(int i=1;i<=n;i++) cin >> a[i],a[i]+=a[i-1];
    mp[a[n]]=n;
    for(int i=n-1;i>=0;i--)
    {
        if(mp[a[i]]==0)
        {
            nxt[i+1]=n+1;
        }
        else
        {
            nxt[i+1]=mp[a[i]];
        }
        mp[a[i]]=i;
    }
    nxt[n+1]=n+1;
    mn[n+1]=n+1;
    for(int i=n;i>=1;i--)
    {
        if(nxt[i]<nxt[mn[i+1]]) mn[i]=i;
        else mn[i]=mn[i+1];
    }
    for(int i=n;i>=1;i--)
    {
        ll u=nxt[i];
        if(u==n+1)
        {
            p[i][0]=n+1;
        }
        else
        {
            u++;
            p[i][0]=mn[u];
        }
    }
    p[n+1][0]=n+1;
    for(int j=1;j<=20;j++)
    {
        for(int i=1;i<=n+1;i++)
        {
            p[i][j]=p[p[i][j-1]][j-1];
        }
    }

    ll q;
    cin >> q;
    for(int i=1;i<=q;i++)
    {
        ll l,r,ans=0;
        cin >> l >> r;
        l=mn[l];
        if(nxt[l]>r) {cout << 0 << '\n';continue;}
        else ans++;
        for(int j=20;j>=0;j--)
        {
            if(nxt[p[l][j]]<=r) l=p[l][j],ans+=1<<j;
        }
        cout << ans << '\n';
    }
}
int main()
{
    fastio
    //freopen(TASKNAME".INP","r",stdin);
    //freopen(TASKNAME".OUT","w",stdout);
    solve();
}

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