Pagini recente » Cod sursa (job #1100775) | Cod sursa (job #47498) | Cod sursa (job #1717881) | Cod sursa (job #2851911) | Cod sursa (job #327809)
Cod sursa(job #327809)
#include<stdio.h>
using namespace std;
int main()
{
int n,k,v[50001],st,sf,i,j;
long long smax2=-1250000000,s=0,smax1=-1250000000;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)scanf("%d",&v[i]);
for(i=k;i<=n;i++)
{
s=0;
for(j=1;j<=i;j++)
{
s+=v[j];
}
if(s>smax1)
{
sf=i;
smax1=s;
}
}
//printf("%d %lld\n",sf,smax1);
if(n==k)
{
printf("1 %d %lld",sf,smax1);
}
else
{
for(i=sf-k-1;i>=1;i--)
{
s=0;
for(j=i+k+1;j>=i;j--)
{
s+=v[j];
}
if(s>smax2)
{
st=i;
smax2=s;
}
}
//printf("%d %d",st,smax2);
printf("%d %d %lld",st,sf,smax2);
}
}