Cod sursa(job #2302767)
| Utilizator | Data | 15 decembrie 2018 10:03:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define INF 9223372036854775808
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
int n, bf, ff, beg;
long long s, nr, max, smax;
scanf("%d", &n);
s=0;
smax=-INF;
bf=1;
beg=1;
for(int i=1; i<=n; i++)
{
scanf("%lld", &nr);
if(s<0)
{
s=0;
beg=i;
}
s+=nr;
if(s>smax)
{
smax=s;
bf=beg;
ff=i;
}
}
printf("%lld %d %d", smax, bf, ff);
return 0;
}
