Pagini recente » Cod sursa (job #2001790) | Cod sursa (job #2041653) | Borderou de evaluare (job #1036354) | Cod sursa (job #2862776) | Cod sursa (job #519049)
Cod sursa(job #519049)
#include <stdio.h>
long int i, n, k, p1, p2, p1rez, p2rez, s, rez, min, x;
long int sum[50002];
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld %ld",&n, &k);
rez=-25000*50000-2;
p1=1;
for(i=1;i<=n;i++)
{
scanf("%ld",&x);
s=s+x;
sum[i]=s;
if (i>=k)
{
if (min>sum[i-k])
{
p1=i-k+1;
min=sum[i-k];
}
if (s-min>rez)
{
rez=s-min;
p1rez=p1;
p2rez=i;
}
}
}
printf("%ld %ld %ld",p1rez, p2rez, rez);
return 0;
}