Pagini recente » Cod sursa (job #593297) | Cod sursa (job #2863044) | Cod sursa (job #33184) | Cod sursa (job #203518) | Cod sursa (job #1294319)
#include <stdio.h>
int a[50001],ct[50001];
long long val[50001];
int main()
{
FILE *fin,*fout;
fin=fopen("secv2.in","r");
fout=fopen("secv2.out","w");
int n,k;
fscanf(fin,"%d%d",&n,&k);
for(int i=0;i<n;i++) fscanf(fin,"%d",&a[i]);
val[0]=a[0];
ct[0]=1;
for(int i=1;i<n;i++)
{
if(val[i-1]+a[i]<=0&&ct[i-1]>=k)
{
val[i]=a[i];
ct[i]=1;
}
else
{
val[i]=val[i-1]+a[i];
ct[i]=ct[i-1]+1;
}
}
int post=-1;
long long maxim=-1250000000;
for(int i=0;i<n;i++)
{
if(ct[i]>=k)
{
if(maxim<=val[i])
{
maxim=val[i];
post=i;
}
}
}
long long s=0;
if(post!=-1) fprintf(fout,"%d %d %lld",post+2-ct[post],post+1,maxim);
fclose(fin);
fclose(fout);
return 0;
}