Cod sursa(job #1625950)
Utilizator | Data | 2 martie 2016 21:32:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
long long maxim,aux;
ifstream f("ssm.in");
ofstream g("ssm.out");
int max(int a,int b)
{
if(a>b) return a;
return b;
}
int main()
{
long long n,i;
f>>n;
for(i=1;i<=n;i++)
{
f>>aux;
maxim=max(maxim+aux,aux);
}
g<<maxim;
return 0;
}