#include<iostream>
#include<math.h>
using namespace std;
int  max(int a,int b){
	return a>b?a:b;
}
int FindGreatestSumOfSubArrey(int input[],int length){
	int TempSum=input[0];
	int MaxSum=TempSum;
	for (int i = 1;i < length; i++){
		TempSum = max(TempSum + input[i],input[i]);
		MaxSum = max(TempSum,MaxSum);
	}
	return MaxSum;
}

int main(){
	int input[] = {1,-2,-5,3,5};
	cout<<FindGreatestSumOfSubArrey(input,5)<<endl;// 結果為8
	return 0;
}