Pagini recente » Cod sursa (job #2914612) | Cod sursa (job #499171) | Cod sursa (job #3273809) | Cod sursa (job #1915273) | Cod sursa (job #2851313)
#include <fstream>
using namespace std;
const int N= 7000005;
const int NMAX = 6000001;
int bestsum[N], n, x, a[NMAX], bestSUM;
int main()
{
ifstream in("ssm.in");
ofstream out("ssm.out");
in >> n;
for (int i = 1;i <= n; i++)
in >> a[i];
bestSUM = a[1];
for (int i = 1; i <= n; i++)
{
bestsum[i] = a[i];
if (bestsum[i] < bestsum[i - 1] + a[i])
bestsum[i] = bestsum[i - 1] + a[i];
if (bestSUM < bestsum[i])
bestSUM = bestsum[i];
}
out << bestSUM;
return 0;
}