Cod sursa(job #1122640)
Utilizator | Data | 25 februarie 2014 19:31:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <cstdio>
using namespace std;
int n,i,j,x,sum,inc,sol=-2^30,begin,end;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
inc=1;
for(i=1;i<=n;i++)
{
scanf("%d",&x);
if(sum<0)
{
sum=x;
inc=i;
}
else
sum+=x;
if(sol<sum)
{
sol=sum;
begin=inc;
end=i;
}
}
printf("%d %d %d ",sol,begin,end);
return 0;
}