#include<list>
#include<iostream>
#include<vector>
using namespace std;
vector<int> FindGreatestSumOfSubArray(vector<int> array) {
vector<int> ret;
int F_i = array[0];
int max_number = array[0];
int low = 0;
int high = 0;
int low_max = 0;
int high_max = 0;
for (int i = 1; i < array.size(); i++) {
if (array[i] <= array[i] + F_i) {
F_i = array[i] + F_i;
high = i;
if (max_number < F_i) {
max_number = F_i;
low_max = low;
high_max = high;
}
}
else {
F_i = array[i];
low = i;
high = i;
if (max_number < F_i) {
max_number = F_i;
low_max = low;
high_max = high;
}
}
}
ret.push_back(max_number);
ret.push_back(low_max);
ret.push_back(high_max);
return ret;
}
int main()
{
int a[] = {1,-2,3,10,-4,7,2,-5};
vector<int>array(a, a + 8);
vector<int> ret=FindGreatestSumOfSubArray( array);
for (int i = 0; i < 3; i++) {
cout << ret[i] << endl;
}
system("pause");
return 0;
}