c_cpp 最大子序列和

Posted 2021-05-14

#include <iostream>
#include <algorithm>
using namespace std;

int N;
const int MAX_N = 1e5 + 5;
int A[MAX_N], dp[MAX_N];

int main() {
	cin >> N;
	for (int n = 0; n < N; n++) {
		cin >> A[n];
	}

	// boundary 
	dp[0] = A[0];
	
	// state trasition equation 
	for (int i = 1; i < N; i++) {
		dp[i] = max(A[i], dp[i - 1] + A[i]);
	}

	cout << *max_element(dp, dp + N) << endl;
	return 0;
}

/*
Sample Input:
6
-2 11 -4 13 -5 -2
Sample Output:
20 (11 + (-4) + 13 = 20)
*/