Cod sursa(job #3195156)
Utilizator | Avram Petru-Teodor xeodor | Data | 20 ianuarie 2024 10:45:27 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n,v[100000],f[100000],x,mx;
int main()
{
cin>>n;
f[1]=1;
for(int i=1;i<=n;i++)
{
cin>>x;
if(f[i-1]<0)
f[i]=x;
else
f[i]=f[i-1]+x;
}
for(int i=1;i<=n;i++)
mx=max(mx,f[i]);
cout<<mx;
return 0;
}