Cod sursa(job #1042302)
Utilizator | Data | 26 noiembrie 2013 20:51:31 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
#define MAX 100
int c[MAX];
int main()
{
int n,i;
int a[MAX];
for(i=1;i<=n;i++)
{
fin >> a[i];
}
c[0]=-1;
for(i=1;i<=n;i++)
c[i]= max(a[i],c[i-1]+a[i]);
for(i=1;i<=n;i++)
cout << c[i] << " ";
return 0;
}