Cod sursa(job #1279070)
Utilizator | Data | 29 noiembrie 2014 18:53:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000010],v[6000010],maxi,i,n;
int main()
{
fin>>n;
for(i=1 ; i<=n ; ++i)
{
fin>>v[i];
}
s[1]=v[1];
maxi=s[1];
for(i=2 ; i<=n ; ++i)
{
if(s[i-1]<0)
{
s[i]=v[i];
}
else
{
s[i]=s[i-1]+v[i];
}
if(maxi<s[i])
maxi=s[i];
}
fout<<maxi;
return 0;
}