Pagini recente » Cod sursa (job #1475466) | Cod sursa (job #482967) | Cod sursa (job #2611231) | Cod sursa (job #1396067) | Cod sursa (job #268552)
Cod sursa(job #268552)
#include <cstdio>
#define inf 0x3f3f3f3f
#define N 50001
int A[N],i,k,n,st,dr,kont,best,max;
int main()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d\n",&n,&k);
for (i=1; i<=n; i++) scanf("%d",&A[i]);
st=dr=1;
kont=1;
best=A[1];
max=-inf;
for (i=2; i<=n; i++)
{
if (best+A[i]>A[i] || kont<k)
{
best+=A[i];
kont++;
if (kont>=k && best>max)
{
dr=i;
max=best;
}
}
else
{
best=A[i];
st=dr=i;
kont=1;
}
}
printf("%d %d %d\n",st,dr,max);
return 0;
}