Pagini recente » Cod sursa (job #909721) | Cod sursa (job #1772819) | Cod sursa (job #1990059) | Cod sursa (job #1093673) | Cod sursa (job #2369590)
#include <bits/stdc++.h>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
long long n,x,l,s[50100],p,r,Min,Max=-2000000,k;
int main()
{
in>>n>>k;
Min=0;
for(int i=1;i<=n;i++)
{
in>>x;
s[i]=s[i-1]+x;
if(i>=k)
{
if(s[i]-Min>Max)
{
Max=s[i]-Min;
l=p+1;
r=i;
}
if(s[i-k+1]<Min) Min=s[i-k+1],p=i-k+1;
}
}
out<<l<<" "<<r<<" "<<Max;
return 0;
}