Cod sursa(job #1519599)
| Utilizator | Data | 7 noiembrie 2015 16:17:58 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
using namespace std;
int main()
{
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int i, s, max, ant = 0, c = 0, n;
int a[6000001];
cin >> n;
s=0; max=0;
for (i = 1; i<=n; i++)
for (i = 0; i<=8; i++)
{
s+= a[i];
if (s>max){
max = s;
c++;
}
if (s <= 0 && c == 1)
{
s -= a[i];
s += ant;
max = s;
s = 0;
}
if (s<0)
{
ant = s;
s = 0;
c = 0;
}
}
cout<<max;
}
