Cod sursa(job #2866660)
Utilizator | Data | 9 martie 2022 21:29:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int x[100];
int n,s=0;
int best[100];
int main()
{
int smax;
cin>>n;
for(int i=1;i<=n;i++)
cin>>x[i];
smax=best[1]=x[1];
for(int i=2;i<=n;i++)
{
best[i]=max(best[i-1]+x[i], x[i]);
if(smax<best[i]) smax=best[i];
}
cout<<smax;
cin.close();
cout.close();
return 0;
}