Cod sursa(job #2308563)
| Utilizator | Data | 27 decembrie 2018 13:00:26 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
void SSM()
{
int N = 0, i = 0, smax = 0, s = 0, x = 0;
fin >> N;
fin >> s;
smax = s;
for (i = 1; i < N; i++)
{
fin >> x;
s += x;
if (s > smax)
smax = s;
if (s < 0)
s = 0;
}
fout << smax << "\n";
}
int main ()
{
SSM();
return 0;
}
