Cod sursa(job #1850876)
Utilizator | Data | 18 ianuarie 2017 23:41:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int maxim,n,v[100000],i;
f>>n;
for(i=n-1;i>=0;i--)
{
f>>v[i];
}
maxim=v[0];
for(int i=1;i<n;i++)
if(v[i]+v[i-1]>v[i])
v[i]+=v[i-1];
for(int i=0;i<n;i++)
if(maxim<v[i])
maxim=v[i];
g<<maxim;
}