Cod sursa(job #2487152)
Utilizator | Data | 4 noiembrie 2019 08:21:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int a[100],i,n,smax=0,s=0;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
smax=a[1];
s=a[1];
if(s<0)
s=0;
for(i=2;i<=n;i++)
{
s=s+a[i];
if(s>smax)
smax=s;
if(s<0)
s=0;
}
g<<smax;
return 0;
}