Cod sursa(job #1969003)
Utilizator | Data | 18 aprilie 2017 09:07:47 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
int n, el, st, summax, sum, beg, fin;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d %d", &n, &el);
st=1; sum=summax=el;
for(int i=2;i<=n;++i)
{
scanf("%d",&el);
if(sum<0)
{
st=i;
sum=el;
}
else sum+=el;
if(sum>summax)
{
summax=sum;
beg=st;
fin=i;
}
}
printf("%d %d %d", summax, beg, fin);
return 0;
}