Maximum sum

#include <iostream>
#include <math.h>
long long a[200000];

int main(){
	int n;
	std::cin >> n;

	for(int i = 0; i < n; i++){
		long long in;
		std::cin >> in;
		a[i] = in;
	}
	for(long long i = 1; i < n; i++){
		a[i] = std::max(a[i-1]+a[i], a[i]);
	}
	long long max = a[0];
	for(long long i = 0; i < n; i++){
		if (a[i] > max) max = a[i];
	}
	for(long long i = 0; i < n; i++){

	}
	std::cout << max;
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED