maximum-absolute-sum-of-any-subarray
1.0.0
Maximum Absolute Sum of Any Subarray
Loading...
Searching...
No Matches
main.cpp
Go to the documentation of this file.
1
#include <bits/stdc++.h>
2
3
using namespace
std;
4
5
class
Solution
6
{
7
public
:
8
int
maxAbsoluteSum
(vector<int>& nums)
9
{
10
int
max_sum = nums[0];
11
int
cur_sum = 0;
12
for
(
int
el: nums)
13
{
14
cur_sum = max(cur_sum, 0);
15
cur_sum += el;
16
max_sum = max(max_sum, cur_sum);
17
}
18
19
int
min_sum = nums[0];
20
cur_sum = 0;
21
for
(
int
el: nums)
22
{
23
cur_sum = min(cur_sum, 0);
24
cur_sum += el;
25
min_sum = min(min_sum, cur_sum);
26
}
27
28
return
max(abs(max_sum), abs(min_sum));
29
}
30
};
31
32
int
main
()
33
{
34
vector<int> nums = {1, -3, 2, 3, -4};
35
cout <<
"output: "
<<
Solution
().
maxAbsoluteSum
(nums) <<
'\n'
;
36
return
0;
37
}
Solution
Definition
main.cpp:6
Solution::maxAbsoluteSum
int maxAbsoluteSum(vector< int > &nums)
Definition
main.cpp:8
main
int main()
Definition
main.cpp:32
main.cpp
Generated by
1.9.8