Cod sursa(job #2228009)
Utilizator | Data | 2 august 2018 14:39:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int dp[6000001];
int main()
{
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int n, maxSum = -(1 << 30);
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
dp[i] = x;
if (dp[i - 1] >= -0) {
dp[i] += dp[i - 1];
}
maxSum = max (maxSum, dp[i]);
}
cout << maxSum;
return 0;
}