Cod sursa(job #671457)
Utilizator | cius catalin ciuscatalin | Data | 31 ianuarie 2012 15:29:16 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#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;
}