Cod sursa(job #2216212)
Utilizator | Data | 25 iunie 2018 22:01:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int main() {
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
long long maxSum = -9999999999;
long long currentSum = 0;
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
currentSum += x;
maxSum = max (currentSum, maxSum);
if (currentSum < 0) {
currentSum = 0;
}
}
cout << maxSum;
return 0;
}