Pagini recente » Cod sursa (job #998991) | Cod sursa (job #1396527) | Cod sursa (job #695411) | Cod sursa (job #3166401) | Cod sursa (job #1416041)
#include <fstream>
#include <iostream>
#include <cstring>
//6000001
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n,a[11],best[11],bestSum=0,i=0;
fin>>n;
memset(best,0,sizeof(best));
memset(a,0,sizeof(a));
for(i=1;i<=n;i++)
{
fin>>a[i];
}
bestSum=a[1];
for (i=1;i<n;++i)
{
best[i]=a[i];
if (best[i]<best[i-1]+a[i])
best[i]=best[i-1]+a[i];
if (bestSum<best[i])
bestSum=best[i];
}
fout<<bestSum;
return 0;
}