Cod sursa(job #3316121)
| Utilizator | Data | 17 octombrie 2025 14:51:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin ("ssm.in");
ofstream fout ("ssm.out");
int v[6000001];
int main()
{
long long n,a,s=0,smax=-200000000000000;
fin>>n;
for(int i=1;i<=n;++i){
fin>>v[i];
}
for(int i=1;i<=n;++i){
s+=v[i];
smax=max(smax,s);
if(s<0){
s=0;
}
}
fout<<smax;
return 0;
}
