제출 #493583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
493583		Jeff12345121	Sum Zero (RMI20_sumzero)	C++14	0 / 100	1035 ms	668 KiB

sumzero

#include <bits/stdc++.h>
#define ff first
#define ss second
#define in cin
#define out cout
using namespace std;

typedef pair<int,int> pp;


const int nmax = 5005;
const int inf = 1000000005;
int n,q;
int v[nmax],a[nmax],s[nmax],dp[nmax];
vector<pp> qs;
void solve(int l , int r) {
    int N = r - l + 1;
    for (int i = l; i <= r; i++) {
        a[i - l + 1] = v[i];
    }
    for (int i = 1; i <= N; i++) {
        s[i] = a[i] + s[i - 1];
    }
    for (int i = 1; i <= N; i++) {
        dp[i] = -inf;
    }
    map<int,int> vec;
    vec[0] = 0;
    for (int i = 1; i <= N; i++) {
        dp[i] = dp[i - 1];
        if (vec.find(s[i]) != vec.end()) {
            dp[i] = max( dp[i] , max(0 , vec[s[i]]) + 1 );
            vec[s[i]] = max(vec[s[i]] , dp[i]);
        } else {
            dp[i] = max(dp[i] , -inf);
            vec[s[i]] = dp[i];
        }
    }

    out << dp[N] << "\n";
}
int main() {
    in >> n;
    for (int i = 1; i <= n; i++) {
        in >> v[i];
    }
    in >> q;
    qs.resize(q + 1);
    for (int i = 1; i <= q; i++) {
        in >> qs[i].ff >> qs[i].ss;
    }

    for (int i = 1; i <= q; i++) {
        solve(qs[i].ff , qs[i].ss);
    }
    return 0;
}

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