Pagini recente » Cod sursa (job #1203360) | Cod sursa (job #1635712) | Cod sursa (job #2120249) | Cod sursa (job #2328070) | Cod sursa (job #671457)
Cod sursa(job #671457)
#include <fstream>
using namespace std;
int main ()
{
int a[100],i,j,n,min,bestsum,sum[1000],best[1000];
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
}
sum[1]=0;
for(i=1;i<=n;i++)
sum[i]=a[i]+sum[i-1];
min=sum[0];
bestsum=a[1];
for(i=1;i<=n;i++)
{
best[i]=sum[i]-min;
if(min>sum[i])
min=sum[i];
if(bestsum<best[i])
bestsum=best[i];
}
g<<bestsum;
return 0;
}