Submission #646824

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
646824	2022-09-30 19:00:07	Tudy006	Sum Zero (RMI20_sumzero)	C++14	100 / 100	282 ms	20400 KiB

sumzero

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 4e5;
const int LOGMAX = 18;
int max_left[NMAX + 1][2];
int l[NMAX + 1];
int r[NMAX + 1];
int ans[NMAX + 1];
pair <int, int> sums[NMAX + 1];
void init( int n ) {
    long long s = 0;
    int x;
    for ( int i = 1; i <= n; i ++ ) {
        cin >> x;
        s += x;
        sums[i] = { s, i };
    }
    sums[0] = { 0, 0 };
    sort( sums, sums + n + 1 );
    for ( int i = 1; i <= n; i ++ ) {
        if ( sums[i].first == sums[i - 1].first )
            max_left[sums[i].second][0] = sums[i - 1].second + 1;
    }
    for ( int i = 1; i <= n; i ++ ) {
        max_left[i][0] = max( max_left[i][0], max_left[i - 1][0] );
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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