Test results - Codility

Your browser is not supported. Please, update your browser or switch to a different one. Learn more about which browsers are supported.

Tasks Details

medium

1. MaxDoubleSliceSum

Find the maximal sum of any double slice.

Task Score

100%

Correctness

100%

Performance

100%

Task description

A non-empty array A consisting of N integers is given.

A triplet (X, Y, Z), such that 0 ≤ X < Y < Z < N, is called a double slice.

The sum of double slice (X, Y, Z) is the total of A[X + 1] + A[X + 2] + ... + A[Y − 1] + A[Y + 1] + A[Y + 2] + ... + A[Z − 1].

For example, array A such that:

A[0] = 3 A[1] = 2 A[2] = 6 A[3] = -1 A[4] = 4 A[5] = 5 A[6] = -1 A[7] = 2

contains the following example double slices:

double slice (0, 3, 6), sum is 2 + 6 + 4 + 5 = 17,

double slice (0, 3, 7), sum is 2 + 6 + 4 + 5 − 1 = 16,

double slice (3, 4, 5), sum is 0.

The goal is to find the maximal sum of any double slice.

Write a function:

int solution(vector<int> &A);

that, given a non-empty array A consisting of N integers, returns the maximal sum of any double slice.

For example, given:

A[0] = 3 A[1] = 2 A[2] = 6 A[3] = -1 A[4] = 4 A[5] = 5 A[6] = -1 A[7] = 2

the function should return 17, because no double slice of array A has a sum of greater than 17.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [3..100,000];

each element of array A is an integer within the range [−10,000..10,000].

Solution

Programming language used C++

Time spent on task 13 minutes

help

Notes

not defined yet

Task timeline

help

‌

Code: 00:30:20 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 00:30:21 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 00:30:48 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    return 
}

Code: 00:30:58 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    return ;
}

Code: 00:31:29 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> sum_left;
    vector<int> sum_ri 
    return ;
}

Code: 00:31:39 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    vector<int> sum_left;
    vector<int> sum_right;
    
     
    return ;
}

Code: 00:32:09 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; )


    return ;
}

Code: 00:32:23 UTC, cpp, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = 
    }


    return ;
}

Code: 00:32:49 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }


    return ;
}

Code: 00:33:04 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i<0; i++){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }


    return ;
}

Code: 00:33:18 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i>0; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }


    return ;
}

Code: 00:33:41 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i>0; i--){
        sum_right[i] = max(sum_right[i+1]+A[i],0);
    }


    return ;
}

Code: 00:34:34 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i+1]+A[i],0);
    }


    return ;
}

Code: 00:35:04 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    


    return ;
}

Code: 00:35:17 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for()


    return ;
}

Code: 00:35:32 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for(int i)


    return ;
}

Code: 00:35:47 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for(int i=)


    return ;
}

Code: 00:36:01 UTC, cpp, autosave

show code in pop-up

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

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for(int i=1; i<len-1; i++){
        ret = 
    }


    return ;
}

Code: 00:36:21 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i], )
    }


    return ;
}

Code: 00:36:49 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i] = max(sum_right[i-1]+A[i],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ;
}

Code: 00:37:37 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i-1]+A[i],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ;
}

Code: 00:38:06 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ;
}

Code: 00:38:16 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ;
}

Code: 00:40:12 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ret;
}

Code: 00:40:13 UTC, cpp, verify, result: Failed

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1])
    }


    return ret;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:27:5: error: expected ';' before '}' token
     }
     ^

Code: 00:40:23 UTC, cpp, verify, result: Failed

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left;
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1]);
    }


    return ret;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.001 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Segmentation Fault

Code: 00:40:45 UTC, cpp, autosave

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left();
    vector<int> sum_right;
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1]);
    }


    return ret;
}

Code: 00:40:52 UTC, cpp, verify, result: Failed

show code in pop-up

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 31

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1]);
    }


    return ret;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 16 expected 17

0.001 s

WRONG ANSWER, got 16 expected 17

Code: 00:41:15 UTC, cpp, autosave

show code in pop-up

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 31 32

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=34)

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1]);
    }


    return ret;
}

Code: 00:41:26 UTC, cpp, autosave

show code in pop-up

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 31 32 33 34

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=3){
        return 0;
    }

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1], sum_right[i+1]);
    }


    return ret;
}

Code: 00:41:40 UTC, cpp, verify, result: Failed

show code in pop-up

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 31 32 33 34

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=3){
        return 0;
    }

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1] + sum_right[i+1]. ret);
    }


    return ret;
}

Analysis

Compile error

func.cpp: In function 'int solution(std::vector<int>&)':
func.cpp:29:51: error: request for member 'ret' in 'sum_right.std::vector<_Tp, _Alloc>::operator[]<int, std::allocator<int> >(((std::vector<int>::size_type)(i + 1)))', which is of non-class type '__gnu_cxx::__alloc_traits<std::allocator<int> >::value_type {aka int}'
         ret = max(sum_left[i-1] + sum_right[i+1]. ret);
                                                   ^~~

Code: 00:41:47 UTC, cpp, verify, result: Passed

show code in pop-up

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 31 32 33 34

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=3){
        return 0;
    }

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1] + sum_right[i+1], ret);
    }


    return ret;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 00:42:14 UTC, cpp, verify, result: Passed

show code in pop-up

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 31 32 33 34

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=3){
        return 0;
    }

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1] + sum_right[i+1], ret);
    }


    return ret;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.001 s

Code: 00:42:19 UTC, cpp, final, score: 100

show code in pop-up

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 31 32 33 34

// you can use includes, for example:
#include <bits/stdc++.h>

using namespace std;

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    
    int len = A.size();
    vector<int> sum_left(len);
    vector<int> sum_right(len);
    int ret = 0;
    if(A.size()<=3){
        return 0;
    }

    for(int i=1; i<len-1; i++){
        sum_left[i] = max(sum_left[i-1]+A[i],0);
    }

    for(int i=len-1; i>1; i--){
        sum_right[i-1] = max(sum_right[i]+A[i-1],0);
    }

    for(int i=1; i<len-1; i++){
        ret = max(sum_left[i-1] + sum_right[i+1], ret);
    }


    return ret;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.001 s

expand all Correctness tests

▶

simple1
first simple test

✔

0.001 s

▶

simple2
second simple test

✔

0.001 s

▶

simple3
third simple test

✔

0.001 s

▶

negative
all negative numbers

✔

0.001 s

▶

positive
all positive numbers

✔

0.001 s

▶

extreme_triplet
three elements

✔

0.001 s

expand all Performance tests

▶

small_random1
random, numbers form -10**4 to 10**4, length = 70

✔

0.001 s

▶

small_random2
random, numbers from -30 to 30, length = 300

✔

0.001 s

▶

medium_range
-1000, ..., 1000

✔

0.001 s

▶

large_ones
random numbers from -1 to 1, length = ~100,000

✔

0.004 s

▶

large_random
random, length = ~100,000

✔

0.008 s

▶

extreme_maximal
all maximal values, length = ~100,000

✔

0.008 s

▶

large_sequence
many the same small sequences, length = ~100,000

✔

0.004 s