Pagini recente » Cod sursa (job #2977162) | Cod sursa (job #2077706) | Istoria paginii runda/abcd1234 | Cod sursa (job #71435) | Cod sursa (job #2814288)
#include <fstream>
using namespace std;
int v[500005];
int main()
{
ifstream cin("secv2.in");
ofstream cout("secv2.out");
long long n,st=1,S=0,k,a,r1,r2;
cin>>n>>k;
for(int i=1;i<=k;i++)
{
cin>>a;
v[i]=v[i-1]+a;
}
S = v[k];
r1 = 1;
r2 = k;
for (int i = k + 1; i <= n; i++)
{
int a;
cin >> a;
v[i] = v[i - 1] + a;
if (v[i] - v[i-k] <= S + a)
S=S+a;
else
st=i-k+1,S=v[i]-v[i-k];
if (S >= v[r2] - v[r1 - 1])
r1=st,r2=i;
}
cout<<r1<<" "<<r2<<" "<<v[r2]-v[r1-1];
return 0;
}