Pagini recente » Cod sursa (job #552477) | Cod sursa (job #1146950) | Cod sursa (job #182709) | Cod sursa (job #42709) | Cod sursa (job #653916)
Cod sursa(job #653916)
#include<iostream>
#include<fstream>
using namespace std;
#define IN "ssm.in"
#define OUT "ssm.out"
#define LUNG 86000
int main()
{
long long int i,sum[LUNG],n,bestSum,min,a[LUNG],N,best[LUNG];
ifstream f(IN);
ofstream g(OUT);
f>>N;
for(i=1; i<=N; i++)
f>>a[i];
sum[0] = 0;
for (i = 1; i <= N; i++)
{
sum[i] = a[i] + sum[i-1];
}
min = sum[0];
bestSum = -100000;
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;
}