# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
942622 | adaawf | Sum Zero (RMI20_sumzero) | C++17 | 939 ms | 19780 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 <iostream>
#include <algorithm>
using namespace std;
int l[400005][2], f[400005];
pair<long long int, int> c[400005];
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
long long int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
c[i] = {c[i - 1].first + x, i};
f[i] = -1e9;
}
sort(c, c + n + 1);
for (int i = 1; i <= n; i++) {
if (c[i].first == c[i - 1].first) {
f[c[i].second] = c[i - 1].second;
}
}
f[0] = l[0][0] = -1;
for (int i = 1; i <= n; i++) {
f[i] = max(f[i - 1], f[i]);
l[i][0] = f[i];
}
for (int j = 0; j <= n; j++) {
int h = j;
for (int k = 0; k < 400; k++) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |