Pagini recente » Cod sursa (job #2051828) | Cod sursa (job #2967533) | Cod sursa (job #2738846) | Cod sursa (job #2261668) | Cod sursa (job #2059196)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n,k,x,start,finish,i,j,maxim=0,a[50000],poz1,poz2,s=0,saux;
int main()
{
fin>>n>>k;
for(int i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
if(i>=k+1)
{
saux=0;
if(i-start>k)
{
for(j=start+1;j<=i-start;j++)
saux=saux+a[j];
}
if(s-a[start]-saux+a[i]>s+a[i])
{
s=s-a[start]-saux+a[i];
start=i-k+1;
finish=i;
}
else
{
finish=i;
s=s+a[i];
}
if(s>maxim)
{
maxim=s;
poz1=start;
poz2=finish;
}
}
else
{s=s+a[i];
start=1;
finish=i;
poz1=1;
finish=i;
maxim=s;}
}
fout<<poz1<<" "<<poz2<<" "<<maxim;
return 0;
}