Tasks Details
easy
1.
MaxSliceSum
Find a maximum sum of a compact subsequence of array elements.
Task Score
100%
Correctness
100%
Performance
100%
A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The sum of a slice (P, Q) is the total of A[P] + A[P+1] + ... + A[Q].
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns the maximum sum of any slice of A.
For example, given array A such that:
A[0] = 3 A[1] = 2 A[2] = -6 A[3] = 4 A[4] = 0the function should return 5 because:
- (3, 4) is a slice of A that has sum 4,
- (2, 2) is a slice of A that has sum −6,
- (0, 1) is a slice of A that has sum 5,
- no other slice of A has sum greater than (0, 1).
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..1,000,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000];
- the result will be an integer within the range [−2,147,483,648..2,147,483,647].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used C#
Time spent on task 9 minutes
Notes
not defined yet
Task timeline
Code: 09:53:29 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
long max_end=-1000000;
long max_slice=-1000000;
int l= A.Length;
if (l ==1) return A[0];
for (int i=0; i<l; i++)
{
max_end=Math.Max(A[i], max_end+A[i]);
max_slice=Math.Max(max_slice, max_end);
}
return (int) max_slice;
}
}
Analysis
Code: 09:53:45 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
long max_end=-1000000;
long max_slice=-1000000;
int l= A.Length;
if (l ==1) return A[0];
for (int i=0; i<l; i++)
{
max_end=Math.Max(A[i], max_end+A[i]);
max_slice=Math.Max(max_slice, max_end);
}
return (int) max_slice;
}
}
User test case 1:
[-2, 2]
Analysis
Code: 10:01:28 UTC,
cs,
verify,
result: Passed
using System;
// you can also use other imports, for example:
using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
long max_end=-1000000;
long max_slice=-1000000;
int l= A.Length;
if (l ==1) return A[0];
for (int i=0; i<l; i++)
{
max_end=Math.Max(A[i], max_end+A[i]);
max_slice=Math.Max(max_slice, max_end);
}
return (int) max_slice;
}
}
User test case 1:
[-2, 2]
Analysis
Code: 10:01:30 UTC,
cs,
final,
score:
100
using System;
// you can also use other imports, for example:
using System.Collections.Generic;
// you can use Console.WriteLine for debugging purposes, e.g.
// Console.WriteLine("this is a debug message");
class Solution {
public int solution(int[] A) {
// write your code in C# 6.0 with .NET 4.5 (Mono)
long max_end=-1000000;
long max_slice=-1000000;
int l= A.Length;
if (l ==1) return A[0];
for (int i=0; i<l; i++)
{
max_end=Math.Max(A[i], max_end+A[i]);
max_slice=Math.Max(max_slice, max_end);
}
return (int) max_slice;
}
}Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N)
expand all
Correctness tests
1.
0.059 s
OK
2.
0.059 s
OK
3.
0.059 s
OK
1.
0.059 s
OK
2.
0.059 s
OK
3.
0.059 s
OK
4.
0.059 s
OK
5.
0.059 s
OK
6.
0.059 s
OK
7.
0.059 s
OK
8.
0.059 s
OK
9.
0.058 s
OK
1.
0.059 s
OK
2.
0.059 s
OK
3.
0.059 s
OK
4.
0.059 s
OK
5.
0.059 s
OK
6.
0.058 s
OK
7.
0.059 s
OK
8.
0.059 s
OK
9.
0.059 s
OK
10.
0.059 s
OK
11.
0.059 s
OK
12.
0.058 s
OK
13.
0.058 s
OK
14.
0.059 s
OK
15.
0.059 s
OK
16.
0.059 s
OK
17.
0.059 s
OK
18.
0.059 s
OK
19.
0.059 s
OK
20.
0.059 s
OK
21.
0.060 s
OK
22.
0.059 s
OK
23.
0.059 s
OK
24.
0.059 s
OK
25.
0.059 s
OK
26.
0.059 s
OK
27.
0.059 s
OK
1.
0.059 s
OK
1.
0.059 s
OK
1.
0.062 s
OK
1.
0.060 s
OK
1.
0.065 s
OK