Cod sursa(job #1938672)
| Utilizator | Data | 24 martie 2017 23:29:04 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#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]={0};
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;
}
