Cod sursa(job #1075682)
| Utilizator | Data | 9 ianuarie 2014 14:19:29 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
# include <cstdio>
# define MAXN 6000001
int i,BEST,x,sum,bestsum,n,beg,end,s;
using namespace std;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d\n", &n);
for(i=1; i<=n; ++i)
{
scanf("%d ", &s);
if(sum<0)
{
sum=s;
x=i;
}
else sum+=s;
if(sum>bestsum)
{
bestsum=sum;
beg=x;
end=i;
}
}
printf("%d %d %d\n", bestsum, beg, end);
}
