Pagini recente » Borderou de evaluare (job #2012330) | Cod sursa (job #2885935) | Cod sursa (job #3146523) | Cod sursa (job #3241704) | Cod sursa (job #197060)
Cod sursa(job #197060)
#include <stdio.h>
long long a[50005];
long long n,s,ci,k,maxk;
long long b[50005];
int main ()
{
freopen ("secv2.in","r",stdin);
freopen ("secv2.out","w",stdout);
long long i,max,p;
scanf ("%d%d",&n,&p);
for (i=1; i<=n; ++i)
scanf ("%d",&a[i]);
s+=a[1];
max=a[1];
b[++k]=a[1];
ci=1;
for (i=2; i<=n; ++i)
{
s+=a[i];
b[++k]=a[i];
if (s<0)
{
s=0;
ci=i+1;
k=0;
}
if (s>max && k>=p)
{
max=s;
maxk=k;
}
}
printf ("%d %d %d\n",ci,ci+maxk-1,max);
/* for (i=1; i<=maxk; ++i)
printf ("%d ",b[i]); */
return 0;
}