Cod sursa(job #2466966)
Utilizator | Data | 3 octombrie 2019 13:41:19 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,zero,suma;
int s[6000005];
int main()
{
in>>n;
for(int i=1;i<=n;++i){
in>>s[i];
s[i]+=s[i-1];
}
zero=0;
suma=INT_MIN;
for(int i=1;i<=n;++i){
zero=min(zero,s[i]);
suma=max(s[i]-zero,suma);
}
out<<suma;
return 0;
}