# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636569 | danikoynov | Sum Zero (RMI20_sumzero) | C++14 | 748 ms | 20156 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
const int maxn = 4e5 + 10, maxlog = 3, base = 100;
int n, dp[maxlog][maxn], q;
void solve()
{
cin >> n;
ll x, sum = 0;
int cl = -1;
unordered_map < ll, int > last;
for (int i = 1; i <= n; i ++)
{
cin >> x;
sum = sum + x;
if (last[sum] != 0 || sum == 0)
cl = max(cl, last[sum]);
last[sum] = i;
dp[0][i] = cl;
}
dp[0][0] = -1;
for (int j = 1; j < maxlog; j ++)
{
dp[j][0] = -1;
for (int i = 1; i <= n; i ++)
{
dp[j][i] = dp[j - 1][i];
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |