Cod sursa(job #2031206)
Utilizator | Data | 2 octombrie 2017 20:39:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int main()
{
int v[100], n, i, j, h,suma, smax=0;
fin>>n;
for(i=0; i<n; i++){
fin>>v[i];
}
for(i=0; i<n; i++){
for(j=0; j<n; j++){
suma=0;
for(h=j; h<=i; h++){
suma=suma+v[h];
if(suma>smax)
smax=suma;
}
}
}
fout<<smax;
return 0;
}