Cod sursa(job #2844864)
Utilizator | Data | 5 februarie 2022 19:17:04 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <iostream>
using namespace std;
int main()
{
int st=0,n,a[100001],dr=0,Smax=-100000,s=0, inc;
cin>>n;
for(int i=1 ; i<= n ; ++i)
{
cin>>a[i];
if(s<0)
s=0, inc= i;
s+=a[i];
if(s> Smax)
Smax=s,st = inc, dr = i;
}
cout <<Smax<<" "<<st << " " << dr;
return 0;
}