Cod sursa(job #1535067)
Utilizator | Data | 24 noiembrie 2015 11:52:10 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
//5 -6 3 4 -2 3 -3
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[8],i,j,s=0,n,maxim=-1000;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
s=a[i];
for(j=i+1;j<=n;j++)
{
s=s+a[j];
if(maxim<s)
maxim=s;
}
}
fout<<maxim;
fin.close();
fout.close();
}