1007 Maximum Subsequence Sum (25 分)

int a[10005];

int main() {
	int n;
	cin >> n;
	for(int i = 0; i < n; i ++) cin >> a[i];
	int sum = -1, s = 0, start = 0, end = n - 1;
	for(int i = 0; i < n; i ++) {
		s += a[i];
		if(s < 0) {
			s = 0;
			continue;
		}
		if(sum < s) {
			sum = s;
			end = i;
		}
	}
	s = 0;
	for(int i = end; i >= 0; i --) {
		s += a[i];
		if(s == sum) start = i;
	}
	if(sum > 0) cout << sum << " " << a[start] << " " << a[end];
	else cout << 0 << " " << a[start] << " " << a[end];
	return 0;
}