Cod sursa(job #2801830)
Utilizator | Data | 16 noiembrie 2021 22:29:13 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
using namespace std;
int main()
{
int n=0,nr=0,i=0,poz1=0,poz2=0,mx=0,st=0,dr=0,ant=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>nr;
if(nr+ant>nr)
{
ant=nr+ant;
poz2=i;
}
else
{
ant=nr;
poz1=poz2=i;
}
if(ant>mx)
{
mx=ant;
st=poz1;
dr=poz2;
}
}
if(st==0)
st=1;
cout<<mx<<" "<<st<<" "<<dr;
return 0;
}