Cod sursa(job #1129748)
Utilizator | Data | 28 februarie 2014 08:50:35 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int main()
{freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
long long int beg,n,s,sum=0,bestsum=-int(2e9),idx,end;
scanf("%lld",&n);
for(int i=1;i<=n;i++)
{
scanf("%lld",&s);
if(sum<0) sum=s,idx=i;
else
sum+=s;
if(bestsum<sum)
{
bestsum=sum,end=i,beg=idx;
}
}
printf("%lld %lld %lld",bestsum,beg,end);
}