Cod sursa(job #3159410)
Utilizator | Data | 21 octombrie 2023 11:40:26 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int main()
{
int n;
fin>>n;
long long maxit=-int(2e9),maxi=-int(2e9);
for(int i=1;i<=n;++i){
long long s;
fin>>s;
maxi=max(s,maxi+s);
if(maxi>maxit){
maxit=maxi;
}
}
cout<<maxit;
return 0;
}