Cod sursa(job #1397380)
Utilizator | Data | 23 martie 2015 14:36:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int s=-1,i,smax,i1,in,sf,x,n;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&x);
if(s<0)
{
s=x;
i1=i;
}
else s=s+x;
if(smax<s)
{
smax=s;
in=i1;
sf=i;
}
}
printf("%d %d %d",smax,in,sf);
return 0;
}