#include <bits/stdc++.h>
using namespace std;

int kadane(vector<int>& arr){
	
	int n=arr.size();
	int current, prev=0,maxsum=0;
	for(int i=1;i<=n;i++){
	current=max(prev+arr[i-1],arr[i-1]); //
	int current1=max(current,0);    //
	prev=current1;
	maxsum=max(maxsum,current1);
	}
	return maxsum;
	
}

int main() {
	// kadane's algorithm 
	vector<int> arr={-1,1,2,3,-10,5,6,7};
	int result=kadane(arr);
	cout<<result<<endl;
	return 0;
}