Cod sursa(job #2940578)
Utilizator | Data | 15 noiembrie 2022 21:04:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000004];
int main()
{
int n,i,poz=1,pozinc,pozf;
long long s=0,smax=-10000000001;
in>>n;
for(i=1;i<=n;++i)
{
if(s<0)
{
s=0;
poz=i;
}
in>>v[i];
s+=v[i];
if(s>smax)
{
smax=s;
pozinc=poz;
pozf=i;
}
}
out<<smax<<" "<<pozinc<<" "<<pozf;
return 0;
}