Cod sursa(job #3264610)
Utilizator | Data | 22 decembrie 2024 18:23:43 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int n, i, x, s, mx, inceput, sfarsit, poz;
int main()
{
cin>>n;
poz=1;
for(i=1;i<=n;i++)
{
cin>>x;
if(s<0)
{
s=0;
poz=i;
}
s=s+x;
if(s>mx)
mx=s;
sfarsit=i;
inceput=poz;
}
cout<<mx<<" "<<inceput<<" "<<sfarsit;
return 0;
}
//1 2 3 4 5
//1 3 6 10 15