-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
77 lines (58 loc) · 1.42 KB
/
main.cpp
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
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
#include <iostream>
#include <vector>
using namespace std;
vector<int> concatinate(int*p,int length) {
int sum = 0;
vector <int> bar;
for (int i =0 ; i<length; i++){
int act = *(p+i) ; // 15,-17, 20, 5, 40, -10
if (sum == 0){
sum+= act;
}
else if (sum > 0 ) {
if (act >= 0 ){
sum += act;
}
else {
bar.push_back(sum);
sum =act ;
}
}
else if (sum<0){
if (act < 0){
sum += act;
}
else {
bar.push_back(sum);
sum = act;
}
}
}
if (sum > 0) bar.push_back(sum);
if (bar.at(0) <0 ) bar.erase(bar.begin()+0);
//Ausgabe
return bar;
}
void simplify (){
}
int main() {
int foo [] = {1, -52 ,39 ,-12 ,3, 25 ,-33 ,5 ,-73 ,-34,500,-1000 ,80}; // { 15,-17, 20, 5, 40, -10 };
int n =sizeof(foo)/sizeof(int);
int max = 0;
for (int i=0; i<n; i++ ) {
for ( int j =i; j<n; j++ ) {
int sum = 0;
for ( int k=i; k<j; k++ ) {
sum += foo[k];
if(sum>max){
max=sum;
}
}
}
}
auto bar = concatinate(&foo[0],n);
for ( int i =0; i<bar.size();i++){
cout << bar.at(i) << " ";
}
return 0;
}