Cod sursa(job #2258509)
Utilizator | Data | 11 octombrie 2018 16:35:29 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int s,bestsum=-99999999999,n,a[6000001];
int k,start,en;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i];
for(int i=1;i<=n;i++)
{
s+=a[i];
if(s<0)
s=0,k=i+1;
else
if(s>bestsum)
{
bestsum=s;
start=k;
en=i;
}
}
cout<<bestsum<<" "<<start<<" "<<en;
return 0;
}