Cod sursa(job #2846955)
Utilizator | Data | 9 februarie 2022 21:28:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int a[6000010];
int main(){
int n,s(0),start,sf,index,ans=-2147000000;
fin >> n;
for(int i=1;i<=n;i++)fin>>a[i];
for(int i=1;i<=n;i++){
if(s<0)s=a[i],index=i;
else s+=a[i];
if(ans<s)ans=s,start=index,sf=i;
}
fout<<ans<< ' '<<start << ' ' << sf;
return 0;
}