Pagini recente » Cod sursa (job #1029155) | Cod sursa (job #388610) | Cod sursa (job #2736464) | Cod sursa (job #1979033) | Cod sursa (job #2047549)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int k,n,a[50001],t1,t2,t;
long long s,maxi;
long long sum[50001];
int main()
{
int i;
fin>>n>>k;
for(i=1;i<=n;i++)
{fin>>a[i];
sum[i]=a[i]+sum[i-1];
}
t1=1;
t2=k;
maxi=sum[k];
for(i=k+1;i<=n;i++)
{
if(sum[i]-sum[t]>sum[i]-sum[i-k])
{
if(sum[i]-sum[t]>maxi)
{
maxi=sum[i]-sum[t];
t2=i;
}
}
else
{
if(sum[i]-sum[i-k]>maxi)
{
maxi=sum[i]-sum[i-k];
t=i-k;
t1=t+1;
t2=i;
}
}
}
fout<<t1<<" "<<t2<<" "<<maxi;
return 0;
}