Pagini recente » Cod sursa (job #2337183) | Cod sursa (job #1685030) | Cod sursa (job #741069) | Cod sursa (job #1981819) | Cod sursa (job #1938673)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int N;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>N;
int a[N+1];
int bbun[N+1];
for(int i=1; i<=N; i++)
f>>a[i];
int summ;
summ = a[1];
for (int i = 1; i <= N; ++ i)
{
bbun[i] = a[i];
if (bbun[i] < bbun[i-1] + a[i])
bbun[i] = bbun[i-1] + a[i];
if (summ < bbun[i])
summ = bbun[i];
}
int i;
int maxx=-32000;
for(i=1;i<=N;i++)
if(maxx<bbun[i])
maxx=bbun[i];
g<<maxx;
return 0;
}