Cod sursa(job #1838349)
Utilizator | Data | 31 decembrie 2016 19:53:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f ("ssm.in");
ofstream g ("ssm.out");
int maxim(int a, int b)
{
if (a>b) return a;
else return b;
}
int n,c[6000000];
int main()
{
int i,sum=0,smax=-2000000000,x;
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
sum=maxim(sum+x,x);
smax=maxim(sum,smax);
}
g<<smax;
return 0;
}