Pagini recente » Clasament 116 | Cod sursa (job #350416) | Cod sursa (job #654208) | Cod sursa (job #768520) | Cod sursa (job #239441)
Cod sursa(job #239441)
#include<stdio.h>
long int b[50000],i1,k,i,min,max,sum,ant,m,poz1,poz2;
int a[50000],n;
void erase()
{
while(a[n]<=0)
n--;
}
void read()
{
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
}
int main ()
{
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&m);
read();
erase();
max=-25000;
for(i=1;i<=n;i++)
{sum=0;
for(k=i;k<=n;k++)
{sum+=a[k];
if(sum>max && k-i>=m)
{max=sum;
poz1=i;
poz2=k;
}
}}
printf("%d %d %d ",poz1,poz2,max);
// sum=a[k+1];
// printf("%d %d %d\n",k+1,i1,b[i1]-b[k]);
return 0;
}