Cod sursa(job #1953331)
Utilizator | Data | 4 aprilie 2017 19:24:07 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[100];
int pozinc,pozsf,smax,s,inc,i,n;
int main()
{
fin>>n;
pozinc=1;pozsf=0;smax=0;s=0;inc=1;
for(i=1;i<=n;i++)
{
s=s+a[i];
if(s>smax)
{
smax=s;
pozsf=i;
pozinc=inc;
}
else if(s<0)
{
s=0;
inc=i+1;
}
}
return 0;
}